Approximability of Partitioning Graphs with Supply and Demand
From MaRDI portal
Publication:5459108
DOI10.1007/11940128_14zbMath1135.90423OpenAlexW1576222209MaRDI QIDQ5459108
Xiao Zhou, Takehiro Ito, Erik D. Demaine, 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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Approximability of Partitioning Graphs with Supply and Demand
