scientific article

zbMath1192.90103MaRDI QIDQ3579459

Fabrizio Grandoni, Thomas Rothvoß, Friedrich Eisenbrand, Guido Schäfer

Publication date: 6 August 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (14)

Approximate robust optimization for the connected facility location problem ⋮ General network design: a unified view of combined location and network design problems ⋮ Dynamic vs. oblivious routing in network design ⋮ Contention-aware data caching in wireless multi-hop ad hoc networks ⋮ Approximate the lower-bounded connected facility location problem ⋮ Connected facility location via random facility sampling and core detouring ⋮ Branch-and-cut-and-price for capacitated connected facility location ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ Deterministic sampling algorithms for network design ⋮ MIP models for connected facility location: a theoretical and computational study ⋮ Approximation algorithms for connected maximum cut and related problems ⋮ Securely Connected Facility Location in Metric Graphs ⋮ A 6.55 factor primal-dual approximation algorithm for the connected facility location problem ⋮ Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem

This page was built for publication: