Publication:4737546
From MaRDI portal
zbMath1049.90011MaRDI QIDQ4737546
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370475.htm
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Online Buy-at-Bulk Network Design, Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem, Exact Approaches for Designing Multifacility Buy-at-Bulk Networks, Unnamed Item, Combinatorial approximation algorithms for buy-at-bulk connected facility location problems, Deterministic sampling algorithms for network design, LP-based approximation algorithms for facility location in buy-at-bulk network design, Improved approximation algorithms for the single-sink buy-at-bulk network design problems, Connected facility location via random facility sampling and core detouring, A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design, Two-level hub Steiner trees, An improved approximation algorithm for the uniform cost-distance Steiner tree problem, Group parking permit problems, Approximation Algorithms for Single and Multi-Commodity Connected Facility Location, Approximability of unsplittable shortest path routing problems, Oblivious Buy-at-Bulk in Planar Graphs, Approximation Algorithms for Buy-at-Bulk Geometric Network Design, From Cost Sharing Mechanisms to Online Selection Problems, LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
