Sciweavers

2 search results - page 1 / 1
» An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theo...
Sort
View
FOCS
2004
IEEE
13 years 8 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau