scientific article; zbMATH DE number 508831

zbMATH Open0790.05085MaRDI QIDQ4280135FDOQ4280135

Authors: Dorothea Wagner 

Publication date: 14 March 1994

Title of this publication is not available (Why is that?)

Recommendations

• Publication:4860272
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
• scientific article; zbMATH DE number 2079349

zbMATH Keywords

complexitypathsplanar graphlinear time algorithmefficient algorithmsSteiner tree packing

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (6)

• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding a noncrossing Steiner forest in plane graphs under a 2-face condition
• Geodesic packing in graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4280135)