SODA 1998 | Sciweavers

15

SODA
1998
ACM

128views Algorithms» more SODA 1998»

A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP

13 years 5 months ago

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

Sanjeev Arora, Michelangelo Grigni, David R. Karge...

claim paper

Read More »

16

click to vote

SODA
1998
ACM

159views Algorithms» more SODA 1998»

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

13 years 5 months 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 »

12

click to vote

SODA
1998
ACM

91views Algorithms» more SODA 1998»

Finding a Large Hidden Clique in a Random Graph

13 years 5 months ago

Download www.math.ucla.edu

Noga Alon, Michael Krivelevich, Benny Sudakov

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers