Parameterized Minimum Cost Partition of a Tree with Supply and Demand

DOI10.1007/978-3-319-19647-3_17zbMath1356.68105OpenAlexW1173592654MaRDI QIDQ3452563

Mugang Lin, Wenjun Li, Qilong Feng

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_17

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Deterministic network models in operations research (90B10)

Related Items

A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs

Cites Work

• Tree \(t\)-spanners in outerplanar graphs via supply demand partition
• Partitioning graphs of supply and demand
• Approximability of partitioning graphs with supply and demand
• Graph partitioning models for parallel computing
• Minimum cost partitions of trees with supply and demand
• Parametric power supply networks
• VLSI Physical Design: From Graph Partitioning to Timing Closure
• Modelling the Power Supply Network – Hardness and Approximation
• PARTITIONING TREES OF SUPPLY AND DEMAND