Hardness of Vertex Deletion and Project Scheduling

DOI10.1007/978-3-642-32512-0_26zbMath1370.68112arXiv1206.3408OpenAlexW2922092846MaRDI QIDQ3167405

Ola Svensson

Publication date: 2 November 2012

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (3)

Complexity of approximating CSP with balance/hard constraints ⋮ Testing Consumer Rationality Using Perfect Graphs and Oriented Discs ⋮ On the approximability of digraph ordering

This page was built for publication: Hardness of Vertex Deletion and Project Scheduling