122
click to vote
SWAT
15 years 6 months ago
2004 Springer 
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
110
Voted
SWAT
15 years 6 months ago
2004 Springer 
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
110
click to vote
SWAT
15 years 6 months ago
2004 Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
106
click to vote
SWAT
15 years 6 months ago
2004 Springer 
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
106
Voted
SWAT
15 years 6 months ago
2004 Springer 
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
|
Algorithms