79
Voted
SODA
1998
ACM
14 years 10 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
SODA
1998
ACM
14 years 10 months ago
1998
ACM
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
57
Voted
SODA
1998
ACM
14 years 10 months ago
1998
ACM