Parameterized Approximability of the Disjoint Cycle Problem
From MaRDI portal
Publication:5428823
DOI10.1007/978-3-540-73420-8_33zbMath1171.68869MaRDI QIDQ5428823
Martin Grohe, Magdalena Grüber
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_33
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
68W25: Approximation algorithms
Related Items
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More, Packing Cycles Faster Than Erdos--Posa, Finding a subdivision of a digraph, Parameterized approximation of dominating set problems, Almost 2-SAT is fixed-parameter tractable, Parameterized approximation via fidelity preserving transformations, Kernels for packing and covering problems, Packing arc-disjoint cycles in tournaments, Euler Digraphs, Evaluation and Enumeration Problems for Regular Path Queries