On fair covering and hitting problems
From MaRDI portal
Publication:2672421
DOI10.1007/978-3-030-86838-3_4OpenAlexW3199809268MaRDI QIDQ2672421
Sayan Bandyapadhyay, Sujoy Bhore, Aritra Banik
Publication date: 8 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86838-3_4
Related Items
The structural complexity landscape of finding balance-fair shortest paths ⋮ On colorful vertex and edge cover problems ⋮ A parameterized approximation scheme for generalized partial vertex cover
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved performance of the greedy algorithm for partial cover
- Approximation algorithms for the partition vertex cover problem
- Approximation algorithms for hitting objects with straight lines
- On the complexity of locating linear facilities in the plane
- Tropical matchings in vertex-colored graphs
- Covering things with things
- Iterative Methods in Combinatorial Optimization
- Point Line Cover
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints
- Fair Colorful k-Center Clustering
- On Partial Covering For Geometric Set Systems
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
