Imagen de Portada

Approximately Dominating Sets in Elections

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Charikar, Moses, Ramakrishnan, Prasanna, Wang, Kangning
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory Discrete Mathematics Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Six Candidates Suffice to Win a Voter Majority
por: Charikar, Moses, et al.
Publicado: (2024)

Breaking the Metric Voting Distortion Barrier
por: Charikar, Moses, et al.
Publicado: (2023)

Distortion of Metric Voting with Bounded Randomness
por: Cai, Ziyi, et al.
Publicado: (2026)

The Popular Dimension of Matchings
por: Connor, Frank, et al.
Publicado: (2025)

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
por: Takazawa, Kenjiro
Publicado: (2024)

Stationary Online Contention Resolution Schemes
por: Aminian, Mohammad Reza, et al.
Publicado: (2026)

Combinatorial Bernoulli Factories
por: Niazadeh, Rad, et al.
Publicado: (2020)

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
por: Bilò, Vittorio, et al.
Publicado: (2025)

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
por: Ekbatani, Farbod, et al.
Publicado: (2026)

Stable Approximation Algorithms for Dominating Set and Independent Set
por: de Berg, Mark, et al.
Publicado: (2024)

Monotone Randomized Apportionment
por: Correa, José, et al.
Publicado: (2024)

Some variations of the secretary problem
por: Agrawal, Sarthak, et al.
Publicado: (2026)

Unbalanced Random Matching Markets with Partial Preferences
por: Potukuchi, Aditya, et al.
Publicado: (2024)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
por: Csáji, Gergely
Publicado: (2023)

Generalized Nash Equilibrium Problems with Mixed-Integer Variables
por: Harks, Tobias, et al.
Publicado: (2021)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
por: Kevi, Eniko, et al.
Publicado: (2024)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
por: Csáji, Gergely
Publicado: (2024)

Distance Vector Domination
por: Cordasco, Gennaro, et al.
Publicado: (2024)

(Independent) Roman Domination Parameterized by Distance to Cluster
por: Ashok, Pradeesha, et al.
Publicado: (2024)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
por: Scheffler, Robert
Publicado: (2025)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
por: Cordasco, Gennaro, et al.
Publicado: (2024)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2026)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
por: Shook, James M., et al.
Publicado: (2025)

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
por: Avila, Tatiana Rocha, et al.
Publicado: (2026)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

Redundancy Is All You Need (for CSP Sparsification)
por: Brakensiek, Joshua, et al.
Publicado: (2024)

Solving Partial Dominating Set and Related Problems Using Twin-Width
por: Balabán, Jakub, et al.
Publicado: (2025)

Merge-width and First-Order Model Checking
por: Dreier, Jan, et al.
Publicado: (2025)

Graph classes through the lens of logic
por: Pilipczuk, Michał
Publicado: (2025)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
por: Hellmuth, Marc, et al.
Publicado: (2023)

On constrained intersection representations of graphs and digraphs
por: Cicalese, Ferdinando, et al.
Publicado: (2025)

A Faster Isomorphism Test for Graphs of Small Degree
por: Grohe, Martin, et al.
Publicado: (2018)

Construction of orientable sequences in $O(1)$-amortized time per bit
por: Gabric, Daniel, et al.
Publicado: (2024)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
por: Ameli, Afrouz Jabal, et al.
Publicado: (2026)

Light Edge Fault Tolerant Graph Spanners
por: Bodwin, Greg, et al.
Publicado: (2025)

The Secretary Problem with Predictions and a Chosen Order
por: Karisani, Helia, et al.
Publicado: (2026)

Sharp Online Hardness for Large Balanced Independent Sets
por: Dhawan, Abhishek, et al.
Publicado: (2025)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
por: Dhawan, Abhishek, et al.
Publicado: (2026)