scientific article

DOI10.4086/toc.2013.v009a024zbMath1366.68083OpenAlexW2117372120MaRDI QIDQ3191594

Ola Svensson

Publication date: 6 October 2014

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2013.v009a024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

schedulinggraphsinapproximabilityvertex deletion problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (7)

Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis ⋮ Inapproximability of $H$-Transversal/Packing ⋮ Target set selection for conservative populations ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ ⋮ Parameterized algorithms for generalizations of directed feedback vertex set

Cites Work

• A Network Flow Computation for Project Cost Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• Deleting vertices to bound path length

This page was built for publication: