1090 search results - page 1 / 218 » Priority Algorithms for Graph Optimization Problems |
61
Voted
WAOA
2004
Springer
15 years 4 months ago
2004
Springer
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
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 (...
JACM
2000
14 years 10 months ago
2000
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...
109
click to vote
WADS
2009
Springer
15 years 5 months ago
2009
Springer
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...
101
click to vote
RTS
2011
14 years 1 months ago
2011
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...