PROGRESS IN COMBINATORIAL OPTIMIZATION

By ROBERT MILLER

A SURVEY OF APPROXIMATION RESULTS FOR LOCAL SEARCH ALGORITHMS APPROXIMATION ALGORITHMS FOR PATH COLORING IN TREES APPROXIMATION ALGORITHMS FOR EDGE-DISJOINT PATHS AND UNSPLITTABLE FLOW INDEPENDENCE AND COLORING PROBLEMS ON INTERSECTION GRAPHS OF DISKS APPROXIMATION ALGORITHMS FOR MIN-MAX AND MAX-MIN RESOURCE SHARING PROBLEMS, AND APPLICATIONS A SIMPLER PROOF OF PREEMPTIVE TOTAL FLOW TIME APPROXIMATION ON PARALLEL MACHINES APPROXIMATING A CLASS OF CLASSI?CATION PROBLEMS LIST SCHEDULING IN ORDER OF ?-POINTS ON A SINGLE MACHINE APPROXIMATION ALGORITHMS FOR THE K-MEDIAN PROBLEM THE LOV´ASZ-LOCAL-LEMMA AND SCHEDULING