scientific article; zbMATH DE number 1947045

MaRDI QIDQ4411275zbMATH OpenFDO

Authors Spyros Angelopoulos, Allan Borodin

Publication date 7 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620026.htm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• The power of priority algorithms for facility location and set cover
• Approximation algorithms for the priority facility location problem with penalties
• Approximation algorithms for the stochastic priority facility location problem
• Approximation algorithms for the priority facility location problem with submodular penalties
• Using a facility location algorithm to solve large set covering problems
• On the geometric priority set cover problem
• Near-optimal disjoint-path facility location through set cover by pairs
• scientific article; zbMATH DE number 1253041
• A survey on approximation algorithms for facility location problems
• scientific article; zbMATH DE number 1559542

Cited in

(10)

• Characterizing sets of jobs that admit optimal greedy-like algorithms
• Priority algorithms for the subset-sum problem
• Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
• On the Structure of Optimal Greedy Computation (for Job Scheduling)
• Approximation and Online Algorithms
• The power of priority algorithms for facility location and set cover
• Priority Algorithms for the Subset-Sum Problem
• Hierarchies for classes of priority algorithms for job scheduling
• Randomized priority algorithms
• Priority algorithms for graph optimization problems

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 Q4411275)