Parameterized Approximation Schemes Using Graph Widths
From MaRDI portal
Publication:5167791
DOI10.1007/978-3-662-43948-7_64zbMath1410.68402arXiv1311.2466OpenAlexW1566367487MaRDI QIDQ5167791
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.2466
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (11)
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parameterized Power Vertex Cover ⋮ Structural parameters, tight bounds, and approximation for \((k, r)\)-center ⋮ Parameterized (Approximate) Defective Coloring ⋮ A parameterized approximation algorithm for the multiple allocation \(k\)-hub center ⋮ Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack ⋮ Structurally parameterized \(d\)-scattered set ⋮ Unnamed Item ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
This page was built for publication: Parameterized Approximation Schemes Using Graph Widths
