Abstract is missing.
- Completeness and Robustness Properties of Min-Wise Independent PermutationsAndrei Z. Broder, Michael Mitzenmacher. 1-10
- Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation FamiliesMichael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman. 11-15
- Independent Sets in Hypergraphs with Applications to Routing via Fixed PathsNoga Alon, Uri Arad, Yossi Azar. 16-27
- Approximating Minimum Manhattan NetworksJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan. 28-38
- Approximation of Multi-color DiscrepancyBenjamin Doerr, Anand Srivastav. 39-50
- A Polynomial Time Approximation Scheme for the Multiple Knapsack ProblemHans Kellerer. 51-62
- Set Cover with Requirements and Costs Evolving over TimeMilena Mihail. 63-72
- Multicoloring Planar Graphs and Partial k-TreesMagnús M. Halldórsson, Guy Kortsarz. 73-84
- Testing the Diameter of GraphsMichal Parnas, Dana Ron. 85-96
- Improved Testing Algorithms for MonotonicityYevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky. 97-108
- Linear Consistency TestingYonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan. 109-120
- Improved Bounds for Sampling Contingency TablesBen Morris. 121-129
- Probabilistic and Deterministic Approximations of the Permanent (abstract)Avi Wigderson. 130
- Improved Derandomization of BPP Using a Hitting Set GeneratorOded Goldreich, Avi Wigderson. 131-137
- Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon SetsAndreas Baltz, Tomasz Schoen, Anand Srivastav. 138-143
- Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority PoliciesRolf H. Möhring, Andreas S. Schulz, Marc Uetz. 144-155
- Efficient Redundant Assignments under Fault-Tolerance ConstraintsDimitris Fotakis, Paul G. Spirakis. 156-167
- Scheduling with Machine CostCsanád Imreh, John Noga. 168-176
- A Linear Time Approximation Scheme for the Job Shop Scheduling ProblemKlaus Jansen, Roberto Solis-Oba, Maxim Sviridenko. 177-188
- Randomized Rounding for Semidefinite Programs-Variations on the MAX CUT ExampleUriel Feige. 189-196
- Hardness Results for the Power Range Assignmet Problem in Packet Radio NetworksAndrea E. F. Clementi, Paolo Penna, Riccardo Silvestri. 197-208
- A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on RingsChristine T. Cheng. 209-220
- Algorithms for Graph Partitioning on the Planted Partition ModelAnne Condon, Richard M. Karp. 221-232
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning ForestSeth Pettie, Vijaya Ramachandran. 233-244
- Fast Approximate PCPs for Multidimensional Bin-Packing ProblemsTugkan Batu, Ronitt Rubinfeld, Patrick White. 245-256
- Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary ConditionsRussell A. Martin, Dana Randall. 257-268
- Scheduling with Unexpected Machine BreakdownsSusanne Albers, Günter Schmidt. 269-280
- Scheduling on a Constant Number of MachinesFoto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis. 281-287