Constant factor approximation for tracking paths and fault tolerant feedback vertex set
From MaRDI portal
Publication:5918533
DOI10.1007/978-3-030-92702-8_2OpenAlexW3191204702MaRDI QIDQ5918533
Ondřej Suchý, Václav Blažej, Jan Matyáš Křišt'an, Pratibha Choudhary, Tomáš Valla, Dušan Knop
Publication date: 19 October 2022
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.01430
Cites Work
- Unnamed Item
- Unnamed Item
- The disjoint paths problem in quadratic time
- Rumor spreading in social networks
- Approximation algorithms for \(k\)-hurdle problems
- How to catch marathon cheaters: new approximation algorithms for tracking paths
- The ellipsoid method and its consequences in combinatorial optimization
- Geometric algorithms and combinatorial optimization
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- Tracking paths
- Fixed-parameter tractable algorithms for tracking shortest paths
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Graph Theory
- Approximating the k-multicut problem
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Reducibility among Combinatorial Problems
- Polynomial Time Algorithms for Tracking Path Problems
- Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
- Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
- Tracking routes in communication networks
- A polynomial sized kernel for tracking paths problem
This page was built for publication: Constant factor approximation for tracking paths and fault tolerant feedback vertex set
