Packing Steiner Forests

DOI10.1007/11496915_27zbMath1119.90362OpenAlexW1483101602MaRDI QIDQ3596337

Lap Chi Lau

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496915_27

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

On routing in VLSI design and communication networks ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ Packing trees in communication networks

This page was built for publication: Packing Steiner Forests