Constant factor approximation for tracking paths and fault tolerant feedback vertex set

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F23%3A00365740" target="_blank" >RIV/68407700:21240/23:00365740 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1016/j.disopt.2022.100756" target="_blank" >https://doi.org/10.1016/j.disopt.2022.100756</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.disopt.2022.100756" target="_blank" >10.1016/j.disopt.2022.100756</a>

Result language

angličtina

Original language name

Constant factor approximation for tracking paths and fault tolerant feedback vertex set

Original language description

Consider a vertex-weighted graph G with a source s and a target t. TRACKING PATHS requires finding a minimum weight set of vertices (trackers) such that the sequence of trackers in each path from s to t is unique. In this work, we derive a factor 6-approximation algorithm for TRACKING PATHS in weighted graphs and a factor 4-approximation algorithm if the input is unweighted. This is the first constant factor approximation for this problem. While doing so, we also study approximation of the closely related r-FAULT TOLERANT FEEDBACK VERTEX SET problem. There, for a fixed integer r and a given vertex-weighted graph G, the task is to find a minimum weight set of vertices intersecting every cycle of G in at least r+1 vertices. We give a factor O(r) approximation algorithm for r-FAULT TOLERANT FEEDBACK VERTEX SET if r is a constant.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2023

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Discrete Optimization

ISSN

1572-5286

e-ISSN

1873-636X

Volume of the periodical

47

Issue of the periodical within the volume

100756

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

16

Pages from-to

—

UT code for WoS article

000961089600001

EID of the result in the Scopus database

2-s2.0-85144452746