Fixed-Parameter and Approximation Algorithms: A New Look

DOI10.1007/978-3-319-03898-8_11zbMath1407.68213arXiv1308.3520OpenAlexW1552693528MaRDI QIDQ2867077

Rajesh Chitnis, Mohammad Taghi Hajiaghayi, Guy Kortsarz

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.3520

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (12)

Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ A review on algorithms for maximum clique problems ⋮ Unnamed Item ⋮ On Directed Steiner Trees with Multiple Roots ⋮ Time-approximation trade-offs for inapproximable problems ⋮ An ETH-tight algorithm for bidirected Steiner connectivity ⋮ From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More ⋮ The Constant Inapproximability of the Parameterized Dominating Set Problem ⋮ Partitioning a graph into small pieces with applications to path transversal ⋮ Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems ⋮ On subexponential and FPT-time inapproximability

This page was built for publication: Fixed-Parameter and Approximation Algorithms: A New Look