Maximum series-parallel subgraph
From MaRDI portal
Publication:2429333
DOI10.1007/s00453-011-9523-4zbMath1236.68293MaRDI QIDQ2429333
Cristina G. Fernandes, Hemanshu Kaul, Gruia Călinescu, Alexander Z. Zelikovsky
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9523-4
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Unnamed Item, Exact algorithms for single-machine scheduling with time windows and precedence constraints, Finding Triangles for Maximum Planar Subgraphs
Cites Work
- On the SPANNING \(k\)-TREE problem
- On spanning 2-trees in a graph
- A new approximation algorithm for finding heavy planar subgraphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A Better Approximation Algorithm for Finding Planar Subgraphs
- Improved Approximations for the Steiner Tree Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item