scientific article; zbMATH DE number 2086941
From MaRDI portal
Publication:4737546
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
From Cost Sharing Mechanisms to Online Selection Problems ⋮ LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design ⋮ Combinatorial approximation algorithms for buy-at-bulk connected facility location problems ⋮ Approximation Algorithms for Buy-at-Bulk Geometric Network Design ⋮ Online Buy-at-Bulk Network Design ⋮ Group parking permit problems ⋮ Connected facility location via random facility sampling and core detouring ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ LP-based approximation algorithms for facility location in buy-at-bulk network design ⋮ Approximation Algorithms for Single and Multi-Commodity Connected Facility Location ⋮ Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem ⋮ Deterministic sampling algorithms for network design ⋮ A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design ⋮ Approximability of unsplittable shortest path routing problems ⋮ Oblivious Buy-at-Bulk in Planar Graphs ⋮ Two-level hub Steiner trees ⋮ Improved approximation algorithms for the single-sink buy-at-bulk network design problems ⋮ Unnamed Item ⋮ An improved approximation algorithm for the uniform cost-distance Steiner tree problem
This page was built for publication:
