Searching for authors named "Spyros Angelopoulos" – sorted by Relevance.
4 documents found, showing 1 through 4.
-
Ordering-preserving transformations and greedy-like algorithms
- …Abstract. Borodin, Nielsen and Rackoff [5] proposed a framework for abstracting the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] extended it so as to make it applicable to graph optimization problems. In this paper we propose a related…
- Cited by 1 (0 self) – Add To MetaCart
-
Improved bounds for the online Steiner tree problem in graphs of bounded edgeasymmetry
- …In this paper we consider the Online Steiner Tree problem in weighted directed graphs of bounded edge-asymmetry α. The edge-asymmetry of a directed graph is defined as the maximum ratio of the cost (weight) of antiparallel edges in the graph. The problem has applications in multicast routing over a …
- Cited by 1 (0 self) – Add To MetaCart
-
The Approximation Power of Priority Algorithms
- …Greedy-like algorithms have been a popular approach in combinatorial optimization, due to their conceptual simplicity and amenability to analysis. Surprisingly, it was only recently that a formal framework for their study emerged. In particular, Borodin, Nielsen and Rackoff introduced the class of p…
- Add To MetaCart
-
On the Power of Priority Algorithms for Facility Location and Set Cover
- …We apply and extend the priority algorithm framework introduced by Borodin, Nielsen and Rackoff to define "greedy-like" algorithms for (uncapacitated) facility location problems and set cover. These problems have been the focus of extensive research from the point of view of approximation algorithms…
- Cited by 14 (5 self) – Add To MetaCart
Showing 1 through 4.
