Approximation schemes for capacitated geometric network design

DOI10.1007/978-3-642-22006-7_3MaRDI QIDQ3012789zbMATH OpenOpenAlexWikidataFDO

Authors Anna Adamaszek, Jakub Onufry Wojtaszczyk, Artur Czumaj, Andrzej Lingas

Publication date 6 July 2011

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22006-7_3

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximation schemes for capacitated geometric network design
• Approximation algorithms for a capacitated network design problem
• scientific article; zbMATH DE number 1670539
• Approximating the k-splittable capacitated network design problem
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design

Cites work

• A catalog of Hanan grid problems
• Approximating the single-sink link-installation problem in network design
• Approximation algorithms for a capacitated network design problem
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design
• Approximation to the Minimum Cost Edge Installation Problem
• Bounds and Heuristics for Capacitated Routing Problems
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305417 (Why is no real title available?)
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The Steiner tree problem

Cited in

(7)

• Approximating the \(k\)-splittable capacitated network design problem
• Approximation algorithms for a capacitated network design problem
• scientific article; zbMATH DE number 1670539 (Why is no real title available?)
• Approximating the k-splittable capacitated network design problem
• Approximating airports and railways
• Approximation schemes for capacitated geometric network design
• A polyhedral study of the capacity formulation of the multilayer network design problem

This page was built for publication: Approximation schemes for capacitated geometric network design

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