Abstract is missing.
- Analysis of a Local Search Heuristic for Facility Location ProblemsMadhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman. 1-10
- Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract)Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber. 11-20
- A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning TreesBang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang. 21-32
- A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSPSanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, Andrzej Woloszyn. 33-41
- Computing Univariate GCDs over Number FieldsMichael B. Monagan, Roger Margot. 42-49
- Extended Hilbert Irreducibility and its ApplicationsMing-Deh A. Huang, Yiu-Chung Wong. 50-58
- Approximate Polynomials Gcds, Padé Approximation, Polynomial Zeros and Bipartite GraphsVictor Y. Pan. 68-77
- LRU is Better than FIFOMarek Chrobak, John Noga. 78-81
- On-Line File CachingNeal E. Young. 82-86
- Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract)Marek Chrobak, John Noga. 87-96
- Online Throughput-Competitive Algorithm for Multicast Routing and Admission ControlAshish Goel, Monika Rauch Henzinger, Serge A. Plotkin. 97-106
- Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract)Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas. 107-116
- I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract)Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter. 117-126
- Collision Detection in Aspect and Scale Bounded PolyhedraSubhash Suri, Philip M. Hubbard, John F. Hughes. 127-136
- An Efficient Algorithm for the Three-Dimensional Diameter ProblemSergei Bespamyatnikh. 137-146
- Faster Algorithms for the Quickest Transshipment Problem with Zero Transit TimesLisa Fleischer. 147-156
- Exact Arithmetic at Low Cost - A Case Study in Linear ProgrammingBernd Gärtner. 157-166
- A Faster Algorithm for Minimum Cost Submodular FlowsSatoru Iwata, S. Thomas McCormick, Maiko Shigeno. 167-174
- Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract)Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann. 181-187
- Fast Backtracking Principles Applied to Find New CagesBrendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon. 188-191
- Approximation Algorithms for Directed Steiner ProblemsMoses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li. 192-200
- Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per ConstraintUri Zwick. 201-210
- New Approximation Techniques for Some Ordering ProblemsSatish Rao, Andréa W. Richa. 211-218
- The Power of Migration in Multi-Processor Scheduling of Real-Time SystemsGilad Koren, Amihood Amir, Emanuel Dar. 226-235
- Computation in Noisy Radio NetworksEyal Kushilevitz, Yishay Mansour. 236-243
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemNaveen Garg, Goran Konjevod, R. Ravi. 253-259
- A New Approximation Algorithm for the Planar Augmentation ProblemSergej Fialko, Petra Mutzel. 260-269
- Flow and Stretch Metrics for Scheduling Continuous Job StreamsMichael A. Bender, Soumen Chakrabarti, S. Muthukrishnan. 270-279
- Optimal Augmentation to Make a Graph k-Edge-Connected and TriconnectedToshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki. 280-289
- Average-Case Analyses of First Fit and Random Fit Bin PackingSusanne Albers, Michael Mitzenmacher. 290-299
- Edge-Connectivity Augmentation with Partition ConstraintsJørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti. 306-315
- Exploring Unknown Undirected GraphsPetrisor Panaite, Andrzej Pelc. 316-322
- On-line Randomized Call Control RevisitedStefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén. 323-332
- Direct Routing on Trees (Extended Abstract)Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. 342-349
- Faster Random Generation of Linear ExtensionsRuss Bubley, Martin E. Dyer. 350-354
- Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid MixingRuss Bubley, Martin E. Dyer, Catherine S. Greenhill. 355-363
- Analysis of Random Processes via And-Or Tree EvaluationMichael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi. 364-373
- Output-Sensitive Generation of Random EventsPaul B. Callahan. 374-383
- On Approximating Rectangle Tiling and PackingSanjeev Khanna, S. Muthukrishnan, Mike Paterson. 384-393
- The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract)Ron Shamir, Dekel Tsur. 394-399
- Matroid Decomposition Methods for the Set Maxima ProblemVincenzo Liberatore. 400-409
- The Dynamic Servers ProblemMoses Charikar, Dan Halperin, Rajeev Motwani. 410-419
- Bounding the Diffuse AdversaryNeal E. Young. 420-425
- Ancient and New Algorithms for Load Balancing in the L::p:: NormAdi Avidor, Yossi Azar, Jiri Sgall. 426-435
- Algorithms for the Maxium Subarray Problem Based on Matrix MultiplicationHisao Tamaki, Takeshi Tokuyama. 446-452
- Approximate String Matching: A Simpler Faster AlgorithmRichard Cole, Ramesh Hariharan. 463-472
- Fast Distributed Algorithms for {Brooks-Vizing} ColouringsDavid A. Grable, Alessandro Panconesi. 473-480
- Mutual Search (Extended Abstract)Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi. 481-489
- Better Random Sampling Algorithms for Flows in Undirected GraphsDavid R. Karger. 490-499
- Augmenting Undirected Edge Connectivity in Õ(n²) TimeAndrás A. Benczúr, David R. Karger. 500-509
- Go with the Winners for Graph BisectionTassos Dimitriou, Russell Impagliazzo. 510-520
- Two New Upper Bounds for SATEdward A. Hirsch. 521-530
- The Analysis of Hybrid Trie StructuresJulien Clément, Philippe Flajolet, Brigitte Vallée. 531-539
- Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic DictionariesPeter Bro Miltersen. 556-563
- Linear-Time Register Allocation for a Fixed Number of RegistersHans Leo Bodlaender, Jens Gustedt, Jan Arne Telle. 574-583
- Multi-Item Inventory Staggering Problems: Heuristic and BoundsChung-Piaw Teo, Jihong Ou, Kok-Choon Tan. 584-593
- Learning Deterministic Finite Automata from Smallest CounterexamplesAndreas Birkendorf, Andreas Böker, Hans-Ulrich Simon. 599-608
- On the Exact Worst Case Query Complexity of Planar Point LocationUdo Adamy, Raimund Seidel. 609-618
- Fast Hierarchical Clustering and Other Applications of Dynamic Closest PairsDavid Eppstein. 619-628
- Analysis of First-Come-First-Serve Parallel Job SchedulingUwe Schwiegelshohn, Ramin Yahyapour. 629-638
- Spatial Codes and the Hardness of String Folding Problems (Extended Abstract)Ashwin Nayak, Alistair Sinclair, Uri Zwick. 639-648
- Greedy Strikes Back: Improved Facility Location AlgorithmsSudipto Guha, Samir Khuller. 649-657
- Exact and Approximation Algorithms for Clustering (Extended Abstract)Pankaj K. Agarwal, Cecilia Magdalena Procopiuc. 658-667
- Authoritative Sources in a Hyperlinked EnvironmentJon M. Kleinberg. 668-677
- Hiding Cliques for Cryptographic SecurityAri Juels, Marcus Peinado. 678-684
- Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract)Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter. 685-694
- Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene OverexpressionsTatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano. 695-702