scientific article; zbMATH DE number 5764866

MaRDI QIDQ3579459zbMATH OpenFDO

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

Publication date 6 August 2010

Mathematics Subject Classification ID

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

Cited in

(11)

• Deterministic sampling algorithms for network design
• Approximate robust optimization for the connected facility location problem
• 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
• MIP models for connected facility location: a theoretical and computational study
• General network design: a unified view of combined location and network design problems
• Securely connected facility location in metric graphs
• Contention-aware data caching in wireless multi-hop ad hoc networks
• Branch-and-cut-and-price for capacitated connected facility location
• Connected facility location via random facility sampling and core detouring
• Approximate the lower-bounded connected facility location problem

This page was built for publication:

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