Simultaneous source location

DOI10.1145/1644015.1644031MaRDI QIDQ2930292zbMATH OpenOpenAlexFDO

Authors Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson, Charles Garrod

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1644015.1644031

zbMATH Keywords

approximation algorithmssubmodular cover

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Continuous location (90B85) Programming involving graphs or networks (90C35)

Recommendations

• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• A note on two source location problems
• Minimum Cost Source Location Problems with Flow Requirements
• Minimum cost source location problems with flow requirements
• scientific article; zbMATH DE number 2152473

Cited in

(7)

• A note on two source location problems
• On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
• Minimum cost source location problems with flow requirements
• Sink location to find optimal shelters in evacuation planning
• Compact oblivious routing
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Static and dynamic source locations in undirected networks

This page was built for publication: Simultaneous source location

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