On colorful vertex and edge cover problems
From MaRDI portal
Publication:6088300
DOI10.1007/s00453-023-01164-6arXiv2308.15842OpenAlexW4386273732MaRDI QIDQ6088300
Aritra Banik, Sayan Bandyapadhyay, Sujoy Bhore
Publication date: 13 December 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.15842
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved performance of the greedy algorithm for partial cover
- Approximation algorithms for the partition vertex cover problem
- Tropical matchings in vertex-colored graphs
- Procedurally fair and stable matching
- On fair covering and hitting problems
- Using Homogeneous Weights for Approximating the Partial Cover Problem
- Iterative Methods in Combinatorial Optimization
- Approximating capacitated k-median with (1 + ∊)k open facilities
- Approximation algorithms for partial covering problems
- On Uniform Capacitated k -Median Beyond the Natural LP Relaxation
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints
- Fair Colorful k-Center Clustering
- On Partial Covering For Geometric Set Systems
- Constant approximation for k-median and k-means with outliers via iterative rounding
- Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
This page was built for publication: On colorful vertex and edge cover problems
