Approximation algorithms for graph augmentation
Journal of Algorithms
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
A 2-approximation algorithm for the minimum weight edge dominating set problem
Discrete Applied Mathematics
Edge dominating and hypomatchable sets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the Hardness of Approximating Multicut and Sparsest-Cut
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 0.01 |
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We refer to D and H as the sets of demand and hitting paths, respectively. When p ∈ H and q ∈ D share at least one mutual edge, we say that p hits q. The objective is to find a minimum cost subset of H whose members collectively hit those of D. In this paper we provide constant factor approximation algorithms for path hitting, confined to instances in which the underlying graph is a tree, a spider, or a star. Although such restricted settings may appear to be very simple, we demonstrate that they still capture some of the most basic covering problems in graphs.