Modelling the Power Supply Network – Hardness and Approximation
From MaRDI portal
Publication:4922115
DOI10.1007/978-3-642-38236-9_7zbMath1382.68332OpenAlexW2150793317MaRDI QIDQ4922115
Publication date: 28 May 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_7
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (6)
Parameterized Minimum Cost Partition of a Tree with Supply and Demand ⋮ A heuristic approach for dividing graphs into bi-connected components with a size constraint ⋮ Partitioning of supply/demand graphs with capacity limitations: an ant colony approach ⋮ 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 heuristic method for solving the problem of partitioning graphs with supply and demand
This page was built for publication: Modelling the Power Supply Network – Hardness and Approximation
