Your search returned the following 16 documents:

16. Online Scheduling of Jobs with Fixed Start Times on Related Machines
    Leah Epstein, Lukasz Jez, Jiri Sgall, and Rob van Stee
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, Boston, USA, 2012, 134-145
    
    
15. An improved algorithm for online rectangle filling
    Rob van Stee
    In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, Liverpool, Great Britain, 2011, 249-260
    [PDF: Download: recfillingJ.pdf]
    
14. On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
    Spyros Angelopoulos
    In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, 2010, 1-12
    
13. On the price of stability for undirected network design
    George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, and Rob van Stee
    In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, 2010, 86-97
    [Download: networkpos.dvi]
    
12. Rumor spreading on random regular graphs and expanders
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Barcelona, Spain, 2010, 560-573
    
11. Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
    Elisabeth Günther, Felix König, and Nicole Megow
    In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, 2010, 170-181
    
10. The Checkpoint Problem
    MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, and Julian Mestre
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Barcelona, Spain, 2010, 219-231
    
9. Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
   Rolf Harren and Rob van Stee
   In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Berkeley, CA, 2009, 177-189
   
8. On the value of preemption in scheduling
   Yair Bartal, Stefano Leonardi, Gill Shallom, and Rene Sitters
   In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Barcelona, Spain, 2006, 39-48
   
7. Centralized deterministic broadcasting in undirected multi-hop radio networks
   Dariusz Kowalski and Andrzej Pelc
   In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, USA, 2004, 171-182
   
6. An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
   Alex Hall, Katharina Langkau, and Martin Skutella
   In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, USA, 2003, 71-82
   
5. Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
   Martin Hoefer
   In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), Ascona, Switzerland, May, 26 - May, 28, 2003, 165-178
   
4. Improving Linear Programming Approaches for the Steiner Tree Problem
   Ernst Althaus, Tobias Polzin, and Siavash Vahdati Daneshmand
   In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, Ascona, Switzerland, May, 26 - May, 28, 2003, 1-14. Note: Pages are not yet known
   
3. The Reliable Algorithmic Software Challenge RASC
   Kurt Mehlhorn
   In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, Ascona, Switzerland, May, 26 - May, 28, 2003, 222-222
   
   
2. A linear time approximation scheme for the job shop scheduling problem
   Roberto Solis-Oba, Klaus Jansen, and Maxim Sviridenko
   In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), Berkeley, U.S.A., August,8 - August, 11, 1999, 1999, 177-188
   
1. Primal-Dual Approaches to the Steiner Problem
   Tobias Polzin and Siavash Vahdati Daneshmand
   In: Approximation Algorithms for Combinatorial Optimization, Saarbrücken, Germany, September 2000, 2000, 214-225