Order-Preserving Transformations and Greedy-Like Algorithms
Author:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 197-210
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Priority Algorithms for Graph Optimization ProblemsLecture Notes in Computer Science, 2005
- (Incremental) Priority AlgorithmsAlgorithmica, 2003
- The online median problem2002
- On the Power of Priority Algorithms for Facility Location and Set CoverLecture Notes in Computer Science, 2002
- Improved Approximation Algorithms for Metric Facility Location Problems2002
- A new greedy approach for facility location problems2002
- A Greedy Facility Location Algorithm Analyzed Using Dual Fitting2001
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxationJournal of the ACM, 2001
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- On approximation problems related to the independent set and vertex cover problemsDiscrete Applied Mathematics, 1984