Approximation Algorithms for Buy-at-Bulk Geometric Network Design

DOI10.1007/978-3-642-03367-4_15MaRDI QIDQ3183450zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Jesper Jansson, Paweł Żyliński, Artur Czumaj, Leszek Gąsieniec, Andrzej Lingas

Publication date 20 October 2009

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-03367-4_15

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for buy-at-bulk geometric network design
• Approximation algorithms for nonuniform buy-at-bulk network design
• Approximation algorithms for node-weighted buy-at-bulk network design
• Improved Approximation for Single-Sink Buy-at-Bulk
• Approximating directed buy-at-bulk network design

Cites work

• A catalog of Hanan grid problems
• A constant factor approximation for the single sink edge installation problems
• Algorithm Theory - SWAT 2004
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
• Approximating the single-sink link-installation problem in network design
• Approximation algorithms for node-weighted buy-at-bulk network design
• Cost-Distance: Two Metric Network Design
• Discrete cost multicommodity network optimization problems and exact solution methods
• scientific article; zbMATH DE number 1670539 (Why is no real title available?)
• scientific article; zbMATH DE number 1670876 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305417 (Why is no real title available?)
• scientific article; zbMATH DE number 1757956 (Why is no real title available?)
• scientific article; zbMATH DE number 1775394 (Why is no real title available?)
• scientific article; zbMATH DE number 1775442 (Why is no real title available?)
• scientific article; zbMATH DE number 2086941 (Why is no real title available?)
• Improved Approximation for Single-Sink Buy-at-Bulk
• Minimum cost capacity installation for multicommodity network flows
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Simpler and better approximation algorithms for network design
• Source sink flows with capacity installation in batches

Cited in

(4)

• Approximation schemes for capacitated geometric network design
• Approximation algorithms for buy-at-bulk geometric network design
• Online Buy-at-Bulk Network Design
• A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design

This page was built for publication: Approximation Algorithms for Buy-at-Bulk Geometric Network Design

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