Sciweavers

1090 search results - page 1 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
WAOA
2004
Springer
99views Algorithms» more  WAOA 2004»
13 years 10 months ago
Priority Algorithms for Graph Optimization Problems
Allan Borodin, Joan Boyar, Kim S. Larsen
COCOON
2007
Springer
13 years 11 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
JACM
2000
131views more  JACM 2000»
13 years 4 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
13 years 11 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
RTS
2011
176views more  RTS 2011»
12 years 7 months ago
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...
Robert I. Davis, Alan Burns