The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Improved performance of the greedy algorithm for partial cover
Information Processing Letters
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
The Minimum Substring Cover problem
Information and Computation
The minimum substring cover problem
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
New results on the complexity of the max- and min-rep problems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Rounding to an integral program
Operations Research Letters
Hi-index | 0.00 |
We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects that induces a collection of pairs covering all elements. Formally, let U be a ground set of elements and let ${\cal S}$ be a set of objects, where each object i has a non-negative cost wi. For every $\{ i, j \} \subseteq {\cal S}$, let ${\cal C}(i,j)$ be the collection of elements in U covered by the pair { i, j }. The set cover with pairs problem asks to find a subset $A \subseteq {\cal S}$ such that $\bigcup_{ \{ i, j \} \subseteq A } {\cal C}(i,j) = U$ and such that ∑i∈Awi is minimized. In addition to studying this general problem, we are also concerned with developing polynomial time approximation algorithms for interesting special cases. The problems we consider in this framework arise in the context of domination in metric spaces and separation of point sets.