PARTITIONING TREES OF SUPPLY AND DEMAND

DOI10.1142/S0129054105003303zbMath1161.90513MaRDI QIDQ5462677

Takehiro Ito, Xiao Zhou, Takao Nishizeki

Publication date: 3 August 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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 (12)

Parameterized Minimum Cost Partition of a Tree with Supply and Demand ⋮ Minimum cost partitions of trees with supply and demand ⋮ Partitioning of supply/demand graphs with capacity limitations: an ant colony approach ⋮ On the complexity of reconfiguration problems ⋮ Partition on trees with supply and demand: kernelization and algorithms ⋮ A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs ⋮ A strongly polynomial time algorithm for the maximum supply rate problem on trees ⋮ Partitioning graphs of supply and demand ⋮ Parametric Power Supply Networks ⋮ Approximability of partitioning graphs with supply and demand ⋮ Parametric power supply networks ⋮ A heuristic method for solving the problem of partitioning graphs with supply and demand

Cites Work

• Unnamed Item
• A linear-time algorithm for four-partitioning four-connected planar graphs
• On the complexity of partitioning graphs into connected subgraphs
• An exact algorithm for large multiple knapsack problems
• Max-Min Tree Partitioning
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

This page was built for publication: PARTITIONING TREES OF SUPPLY AND DEMAND