Path hitting in acyclic graphs

Ojas Parekh, Danny Segev

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms, ESA 2006 - 14th Annual European Symposium, Proceedings
PublisherSpringer Verlag
Pages564-575
Number of pages12
ISBN (Print)3540388753, 9783540388753
DOIs
StatePublished - 2006
Event14th Annual European Symposium on Algorithms, ESA 2006 - Zurich, Switzerland
Duration: 11 Sep 200613 Sep 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4168 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Annual European Symposium on Algorithms, ESA 2006
Country/TerritorySwitzerland
CityZurich
Period11/09/0613/09/06

Fingerprint

Dive into the research topics of 'Path hitting in acyclic graphs'. Together they form a unique fingerprint.

Cite this