Constrained Steiner trees in Halin graphs

DOI10.1051/ro:2003020zbMath1039.05058OpenAlexW2047099617MaRDI QIDQ4467896

Rainer E. Burkard, Guangting Chen

Publication date: 10 June 2004

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2003__37_3_179_0

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Computing straight-line 3D grid drawings of graphs in linear volume ⋮ One quantifier alternation in first-order logic with modular predicates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner problem in Halin networks
• The Steiner tree problem
• Steiner problem in networks: A survey
• Approximation Schemes for the Restricted Shortest Path Problem
• A simple efficient approximation scheme for the restricted shortest path problem
• Steiner tree problems

This page was built for publication: Constrained Steiner trees in Halin graphs