scientific article; zbMATH DE number 1979534

zbMath1019.90043MaRDI QIDQ4427881

Takehiro Ito, Xiao Zhou, Takao Nishizeki

Publication date: 14 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180612.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treealgorithmapproximationdemandFPTASsupplypartition problemmaximum partition problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Tree \(t\)-spanners in outerplanar graphs via supply demand partition ⋮ A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs

This page was built for publication: