TY - GEN

T1 - Path hitting in acyclic graphs

AU - Parekh, Ojas

AU - Segev, Danny

PY - 2006

Y1 - 2006

N2 - An instance of the path hitting problem consists of two families of paths, script D sign and ℋ, in a common undirected graph, where each path in ℋ is associated with a non-negative cost. We refer to script D sign and ℋ as the sets of demand and hitting paths, respectively. When p ∈ ℋ and q ∈ script D sign share at least one mutual edge, we say that p hits q. The objective is to find a minimum cost subset of ℋ whose members collectively hit those of script D sign. 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.

AB - An instance of the path hitting problem consists of two families of paths, script D sign and ℋ, in a common undirected graph, where each path in ℋ is associated with a non-negative cost. We refer to script D sign and ℋ as the sets of demand and hitting paths, respectively. When p ∈ ℋ and q ∈ script D sign share at least one mutual edge, we say that p hits q. The objective is to find a minimum cost subset of ℋ whose members collectively hit those of script D sign. 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.

UR - http://www.scopus.com/inward/record.url?scp=33750699287&partnerID=8YFLogxK

U2 - 10.1007/11841036_51

DO - 10.1007/11841036_51

M3 - Conference contribution

AN - SCOPUS:33750699287

SN - 3540388753

SN - 9783540388753

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 564

EP - 575

BT - Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings

PB - Springer Verlag

T2 - 14th Annual European Symposium on Algorithms, ESA 2006

Y2 - 11 September 2006 through 13 September 2006

ER -