Imagen de Portada

Balanced Spanning Tree Distributions Have Separation Fairness

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Harry, Munagala, Kamesh, Sankar, Govind S.
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computers and Society
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Individual Fairness in Graph Decomposition
por: Munagala, Kamesh, et al.
Publicado: (2024)

Group Fairness and Multi-criteria Optimization in School Assignment
por: A., Santhini K., et al.
Publicado: (2024)

Data Exchange Markets via Utility Balancing
por: Bhaskara, Aditya, et al.
Publicado: (2024)

Fair Multi-agent Persuasion with Submodular Constraints
por: Bai, Yannan, et al.
Publicado: (2025)

Online Distributed Queue Length Estimation
por: Bhaskara, Aditya, et al.
Publicado: (2025)

The Limits of Interval-Regulated Price Discrimination
por: Munagala, Kamesh, et al.
Publicado: (2024)

Sample-Efficient Optimization over Generative Priors via Coarse Learnability
por: Awasthi, Pranjal, et al.
Publicado: (2025)

Compact Conformal Subgraphs
por: Gollapudi, Sreenivas, et al.
Publicado: (2026)

Differential Privacy with Multiple Selections
por: Goel, Ashish, et al.
Publicado: (2024)

Fair Submodular Cover
por: Chen, Wenjing, et al.
Publicado: (2024)

Continuous Fairness On Data Streams
por: Ghosh, Subhodeep, et al.
Publicado: (2026)

Time Fairness in Online Knapsack Problems
por: Lechowicz, Adam, et al.
Publicado: (2023)

Fairness Implications of Encoding Protected Categorical Attributes
por: Mougan, Carlos, et al.
Publicado: (2022)

Fairness in Streaming Submodular Maximization over a Matroid Constraint
por: Halabi, Marwa El, et al.
Publicado: (2023)

A Scalable Algorithm for Individually Fair K-means Clustering
por: Bateni, MohammadHossein, et al.
Publicado: (2024)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
por: Salem, Jad, et al.
Publicado: (2024)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
por: Funk, Nicole, et al.
Publicado: (2026)

Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing
por: Basu, Debabrota, et al.
Publicado: (2025)

Time, Message and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation
por: Goldenfeld, Michael Elkin Tanya
Publicado: (2026)

Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
por: Brous, Daniel, et al.
Publicado: (2025)

Ranking with Partitioning
por: Boardman, Samuel
Publicado: (2026)

Construction and Preliminary Validation of a Dynamic Programming Concept Inventory
por: Ferland, Matthew, et al.
Publicado: (2024)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
por: Focke, Jacob, et al.
Publicado: (2022)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
por: Bentert, Matthias, et al.
Publicado: (2024)

Emit As You Go: Enumerating Edges of a Spanning Tree
por: Casel, Katrin, et al.
Publicado: (2025)

Causal Equal Protection as Algorithmic Fairness
por: Di Bello, Marcello, et al.
Publicado: (2024)

Online Disjoint Spanning Trees and Polymatroid Bases
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Planar Length-Constrained Minimum Spanning Trees
por: Hershkowitz, D Ellis, et al.
Publicado: (2025)

Spanning and Metric Tree Covers Parameterized by Treewidth
por: Elkin, Michael, et al.
Publicado: (2025)

Budget and Profit Approximations for Spanning Tree Interdiction
por: Ostrovsky, Rafail, et al.
Publicado: (2025)

Simple Length-Constrained Minimum Spanning Trees
por: Hershkowitz, D Ellis, et al.
Publicado: (2024)

Fair Clustering: Critique, Caveats, and Future Directions
por: Dickerson, John, et al.
Publicado: (2024)

Upward-Planar Drawings with Bounded Span
por: Angelini, Patrizio, et al.
Publicado: (2026)

Weakly Leveled Planarity with Bounded Span
por: Bekos, Michael, et al.
Publicado: (2024)

Robust Fair Clustering with Group Membership Uncertainty Sets
por: Duppala, Sharmila, et al.
Publicado: (2024)

Stochastic Minimum Spanning Trees with a Single Sample
por: Hoeksma, Ruben, et al.
Publicado: (2024)

Two Complexity Results on Spanning-Tree Congestion Problems
por: Atalig, Sunny, et al.
Publicado: (2026)

Enumerating All Directed Spanning Trees in Optimal Time
por: Gawrychowski, Paweł, et al.
Publicado: (2026)

Explaining Rankings with Hidden Group Bonuses
por: Yan, Alvin Hong Yao, et al.
Publicado: (2026)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
por: Anand, Aditya, et al.
Publicado: (2025)