Integer Priority Queues with Decrease Key in . . .

Integer Priority Queues with Decrease Key in . . . (2003)

by Mikkel Thorup

Venue:	STOC'03
Citations:	16 - 1 self

User correction supplied by mph

Datum	Value	Source
TITLE	Integer Priority Queues with Decrease Key in . . .	user correction
AUTHOR NAME	Mikkel Thorup	user correction
ABSTRACT	We consider Fibonacci heap style integer priority queues supporting insert and decrease key operations in constant time. We present a deterministic linear space solution that with n integer keys support delete in O(log log n) time. If the integers are in the range [0,N), we can also support delete in O(log log N) time. Even for the special case of monotone priority queues, where the minimum has to be non-decreasing, the best previous bounds on delete were O((log n) 1/(3−ε) ) and O((log N) 1/(4−ε)). These previous bounds used both randomization and amortization. Our new bounds a deterministic, worst-case, with no restriction to monotonicity, and exponentially faster. As a classical application, for a directed graph with n nodes and m edges with non-negative integer weights, we get single source shortest paths in O(m + n log log n) time, or O(m + n log log C) ifC is the maximal edge weight. The later solves an open problem of Ahuja, Mehlhorn, Orlin, and	SVM HeaderParse 0.2
YEAR	2003	user correction
VENUE	STOC'03	user correction
CITATIONS	26 found	ParsCit 1.0