APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN
DOI10.1142/S0129054111009148zbMath1233.90079OpenAlexW3152988225MaRDI QIDQ3224959
Jurek Czyzowicz, Jesper Jansson, Paweł Żyliński, Artur Czumaj, Andrzej Lingas, Leszek Gąsieniec
Publication date: 13 March 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111009148
dynamic programmingapproximation algorithmgeometric networksbuy-at-bulkbelt decompositionHanan gridquasi-polynomial-time approximation scheme (QPTAS)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Source sink flows with capacity installation in batches
- Discrete cost multicommodity network optimization problems and exact solution methods
- Connected facility location via random facility sampling and core detouring
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
- Approximating the Single-Sink Link-Installation Problem in Network Design
- A catalog of Hanan grid problems
- Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- On Steiner’s Problem with Rectilinear Distance
This page was built for publication: APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN
