Maximum series-parallel subgraph

DOI10.1007/s00453-011-9523-4zbMath1236.68293OpenAlexW2077502829MaRDI 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

zbMATH Keywords

approximation algorithmseries-parallel graph

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Finding Triangles for Maximum Planar Subgraphs ⋮ Unnamed Item

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

This page was built for publication: Maximum series-parallel subgraph