Approximability of Partitioning Graphs with Supply and Demand

DOI10.1007/11940128_14MaRDI QIDQ5459108zbMATH OpenOpenAlexFDO

Authors Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximability of partitioning graphs with supply and demand
• Partitioning graphs of supply and demand
• scientific article; zbMATH DE number 1979534
• Minimum cost partitions of trees with supply and demand
• Modelling the power supply network -- hardness and approximation

Cited in

(4)

• Approximability of partitioning graphs with supply and demand
• scientific article; zbMATH DE number 1342136 (Why is no real title available?)
• Modelling the power supply network -- hardness and approximation
• Partitioning graphs of supply and demand

This page was built for publication: Approximability of Partitioning Graphs with Supply and Demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459108)