Copertina

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Inamdar, Tanmay, Jain, Pallavi, Lokshtanov, Daniel, Sahu, Abhishek, Saurabh, Saket, Upasana, Anannya
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Dominating Set with Quotas: Balancing Coverage and Constraints
di: Chatterjee, Sobyasachi, et al.
Pubblicazione: (2026)

FPT Approximations for Connected Maximum Coverage
di: Inamdar, Tanmay, et al.
Pubblicazione: (2026)

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
di: Gupta, Sushmita, et al.
Pubblicazione: (2024)

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
di: Gupta, Sushmita, et al.
Pubblicazione: (2025)

Cuts in Graphs with Matroid Constraints
di: Banik, Aritra, et al.
Pubblicazione: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
di: Bentert, Matthias, et al.
Pubblicazione: (2025)

Conflict and Fairness in Resource Allocation
di: Bandopadhyay, Susobhan, et al.
Pubblicazione: (2024)

Minimum Envy Graphical House Allocation Beyond Identical Valuations
di: Inamdar, Tanmay, et al.
Pubblicazione: (2026)

Stability in Graphs with Matroid Constraints
di: Fomin, Fedor V., et al.
Pubblicazione: (2024)

Subexponential Parameterized Algorithms for Hitting Subgraphs
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

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

Parameterized Geometric Graph Modification with Disk Scaling
di: Fomin, Fedor V., et al.
Pubblicazione: (2024)

Hybrid k-Clustering: Blending k-Median and k-Center
di: Fomin, Fedor V., et al.
Pubblicazione: (2024)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
di: Fomin, Fedor V., et al.
Pubblicazione: (2025)

Fixed-Parameter Tractability of Hedge Cut
di: Fomin, Fedor V., et al.
Pubblicazione: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
di: Agrawal, Akanksha, et al.
Pubblicazione: (2024)

Path Contraction Faster than $2^n$
di: Agrawal, Akanksha, et al.
Pubblicazione: (2025)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
di: Jana, Satyabrata, et al.
Pubblicazione: (2025)

Controlling Delegations in Liquid Democracy
di: Alouf-Heffetz, Shiri, et al.
Pubblicazione: (2024)

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

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
di: S, Ajaykrishnan E, et al.
Pubblicazione: (2025)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
di: Kumar, Mithilesh, et al.
Pubblicazione: (2024)

A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
di: Kumar, Mithilesh, et al.
Pubblicazione: (2016)

Improved Algorithms for Fair Matroid Submodular Maximization
di: Mahabadi, Sepideh, et al.
Pubblicazione: (2026)

Multiagent Matroid Upgrading: Greedy is Fair and Efficient
di: Ma, Qingwen, et al.
Pubblicazione: (2026)

Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
di: Hébert-Johnson, Úrsula, et al.
Pubblicazione: (2025)

Subquadratic Submodular Maximization with a General Matroid Constraint
di: Kobayashi, Yusuke, et al.
Pubblicazione: (2024)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2026)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
di: Gupta, Sushmita, et al.
Pubblicazione: (2024)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
di: Bandyapadhyay, Sayan, et al.
Pubblicazione: (2024)

Lower Bounds for Matroid Optimization Problems with a Linear Constraint
di: Doron-Arad, Ilan, et al.
Pubblicazione: (2023)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
di: Hebert-Johnson, Ursula, et al.
Pubblicazione: (2023)

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

Fairness and Efficiency in Two-Sided Matching Markets
di: Jain, Pallavi, et al.
Pubblicazione: (2025)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
di: Bandyapadhyay, Sayan, et al.
Pubblicazione: (2023)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
di: Arndt, Stephen, et al.
Pubblicazione: (2025)

Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation
di: Hellerstein, Lisa, et al.
Pubblicazione: (2026)