Pages that link to "Item:Q2429344"

The following pages link to Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344):

Displaying 11 items.

• \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
• The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
• Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
• Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
• Reliability assessment of the divide-and-swap cube in terms of generalized connectivity (Q2680983) (← links)
• On Element-Connectivity Preserving Graph Simplification (Q3452796) (← links)
• Packing element-disjoint steiner trees (Q4962687) (← links)
• (Q5092436) (← links)
• Algorithms – ESA 2004 (Q5464577) (← links)
• Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem (Q6601971) (← links)
• An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem (Q6606207) (← links)