SODA 1998 - PDF Preprint Papers

SODA 1998 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-1998 Paper

click to vote

SODA
1998
ACM

159views Algorithms» more SODA 1998»

Average-Case Analyses of First Fit and Random Fit Bin Packing

14 years 23 days ago

Download www.eecs.harvard.edu

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...

Susanne Albers, Michael Mitzenmacher

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	159	Average-Case Analyses of First Fit and Random Fit Bin Packing	claim
2	157	Approximate String Matching: A Simpler Faster Algorithm	claim
3	157	A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees	claim
4	144	Analysis of Random Processes via And-Or Tree Evaluation	claim
5	128	A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP	claim
6	116	Authoritative Sources in a Hyperlinked Environment	claim
7	114	Exact Arithmetic at Low Cost - A Case Study in Linear Programming	claim
8	113	Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs	claim
9	106	Greedy Strikes Back: Improved Facility Location Algorithms	claim
10	104	On-line Randomized Call Control Revisited	claim
11	99	Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control	claim
12	99	On-Line File Caching	claim
13	98	Finger Search Trees with Constant Insertion Time	claim
14	94	Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries	claim
15	91	Finding a Large Hidden Clique in a Random Graph	claim
16	89	Approximation Algorithms for Directed Steiner Problems	claim
17	88	Fast Distributed Algorithms for {Brooks-Vizing} Colourings	claim
18	86	Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times	claim
19	86	Analysis of a Local Search Heuristic for Facility Location Problems	claim
20	83	Collision Detection in Aspect and Scale Bounded Polyhedra	claim
21	81	The Dynamic Servers Problem	claim
22	71	On the Distributed Complexity of Computing Maximal Matchings	claim
23	68	An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers