Abstract is missing.
- Online Packet SwitchingYossi Azar. 1-5 [doi]
- Approximation Algorithms for Mixed Fractional Packing and Covering ProblemsKlaus Jansen. 6-8 [doi]
- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-TreesDániel Marx. 9-22 [doi]
- Online Bin Packing with Resource AugmentationLeah Epstein, Rob van Stee. 23-35 [doi]
- A PTAS for Delay Minimization in Establishing Wireless Conference CallsLeah Epstein, Asaf Levin. 36-47 [doi]
- This Side Up!Leah Epstein, Rob van Stee. 48-60 [doi]
- Approximation Algorithm for Directed MulticutsYana Kortsarts, Guy Kortsarz, Zeev Nutov. 61-67 [doi]
- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum CriteriaRajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. 68-82 [doi]
- Approximation Algorithms for Spreading PointsSergio Cabello. 83-96 [doi]
- More Powerful and Simpler Cost-Sharing MethodsPaolo Penna, Carmine Ventre. 97-110 [doi]
- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity ConstraintsHadas Shachnai, Oded Shmueli, Robert Sayegh. 111-125 [doi]
- Priority Algorithms for Graph Optimization ProblemsAllan Borodin, Joan Boyar, Kim S. Larsen. 126-139 [doi]
- Pricing Network Edges to Cross a RiverAlexander Grigoriev, Stan P. M. van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou. 140-153 [doi]
- Submodular Integer Cover and Its Application to Production PlanningToshihiro Fujito, Takatoshi Yabuta. 154-166 [doi]
- Stochastic Online Scheduling on Parallel MachinesNicole Megow, Marc Uetz, Tjark Vredeveld. 167-180 [doi]
- A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian PathDavide Bilò, Guido Proietti. 181-196 [doi]
- Order-Preserving Transformations and Greedy-Like AlgorithmsSpyros Angelopoulos. 197-210 [doi]
- Off-line Admission Control for Advance Reservations in Star NetworksUdo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl. 211-224 [doi]
- Joint Base Station SchedulingThomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer. 225-238 [doi]
- Universal Bufferless RoutingCostas Busch, Malik Magdon-Ismail, Marios Mavronicolas. 239-252 [doi]
- Strong Colorings of HypergraphsGeir Agnarsson, Magnús M. Halldórsson. 253-266 [doi]
- Deterministic Monotone Algorithms for Scheduling on Related MachinesPasquale Ambrosio, Vincenzo Auletta. 267-280 [doi]
- Better Bounds for Minimizing SONET ADMsLeah Epstein, Asaf Levin. 281-294 [doi]