Imagen de Portada

Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gadekar, Ameet, Gionis, Aristides, Thejaswi, Suhas, Tu, Sijing
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
por: Gadekar, Ameet, et al.
Publicado: (2025)

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
por: Thejaswi, Suhas, et al.
Publicado: (2024)

Label-consistent clustering for evolving data
por: Gadekar, Ameet, et al.
Publicado: (2025)

FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
por: Gadekar, Ameet
Publicado: (2026)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
por: Tu, Sijing, et al.
Publicado: (2025)

Sequential Diversification with Provable Guarantees
por: Wang, Honglian, et al.
Publicado: (2024)

On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
por: Gadekar, Ameet
Publicado: (2026)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
por: Wang, Honglian, et al.
Publicado: (2026)

Restless reachability problems in temporal graphs
por: Thejaswi, Suhas, et al.
Publicado: (2020)

On the Hardness of Approximation of the Fair k-Center Problem
por: Thejaswi, Suhas
Publicado: (2026)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
por: Bhore, Sujoy, et al.
Publicado: (2025)

Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights
por: Gadekar, Ameet, et al.
Publicado: (2024)

FPT approximations for Capacitated Sum of Radii and Diameters
por: Filtser, Arnold, et al.
Publicado: (2024)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
por: Gadekar, Ameet, et al.
Publicado: (2025)

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
por: Zhang, Guangyi, et al.
Publicado: (2025)

Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
por: Ciaperoni, Martino, et al.
Publicado: (2025)

Efficient and Adaptive Estimation of Local Triadic Coefficients
por: Sarpe, Ilie, et al.
Publicado: (2025)

Scalable Temporal Motif Densest Subnetwork Discovery
por: Sarpe, Ilie, et al.
Publicado: (2024)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
por: Zhang, Guangyi, et al.
Publicado: (2026)

Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
por: Ahmadian, Sara, et al.
Publicado: (2024)

Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
por: Pettie, Seth, et al.
Publicado: (2020)

Matchings, Predictions and Counterfactual Harm in Refugee Resettlement Processes
por: Lee, Seungeon, et al.
Publicado: (2024)

Max-Cut with Multiple Cardinality Constraints
por: Makarychev, Yury, et al.
Publicado: (2025)

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
por: Xu, Chao, et al.
Publicado: (2026)

Logarithmic Approximations for Fair k-Set Selection
por: Li, Shi, et al.
Publicado: (2025)

Improved Rank Aggregation under Fairness Constraint
por: Chakraborty, Diptarka, et al.
Publicado: (2025)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
por: Cohen, Edith, et al.
Publicado: (2025)

Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments
por: Ansaripour, Matin, et al.
Publicado: (2024)

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
por: Doron-Arad, Ilan, et al.
Publicado: (2023)

Gabow's $O(\sqrt{n}m)$ Maximum Cardinality Matching Algorithm, Revisited
por: Mehlhorn, Kurt, et al.
Publicado: (2026)

Limitations of Stochastic Selection with Pairwise Independent Priors
por: Dughmi, Shaddin, et al.
Publicado: (2023)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
por: Rui, Xiaobin, et al.
Publicado: (2025)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
por: Jäger, Sven, et al.
Publicado: (2024)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
por: Abbasi, Fateme, et al.
Publicado: (2023)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
por: Qi, Yiyan, et al.
Publicado: (2024)

Targeted Least Cardinality Candidate Key for Relational Databases
por: Nakos, Vasileios, et al.
Publicado: (2024)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
por: Kurita, Kazuhiro, et al.
Publicado: (2022)

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches
por: Cohen, Edith, et al.
Publicado: (2024)

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
por: Shahbazi, Nima, et al.
Publicado: (2025)

Combinatorial Selection with Costly Information
por: Chawla, Shuchi, et al.
Publicado: (2024)