Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications, generated: 20:10, 18 April 2014

Search the publication database

  . Return

Your search returned the following 42 documents:

  1. George Christodoulou, Annamaria Kovacs, and Rob van Stee
    A truthful constant approximation for maximizing the minimum load on related machines
    Theoretical Computer Science 489-490: 88-98, 2013

  2. Leah Epstein, Asaf Levin, and Rob van Stee
    A unified approach to truthful scheduling on related machines
    In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, USA, 2013, 1243-1252
    [PDF: Download: monotone_PTAS_SODA_proceedings.pdf]
  3. Sandy Heydrich and Rob van Stee
    Dividing connected chores fairly
    In: 6th International Symposium on Algorithmic Game Theory, Aachen, Germany, 2013, 420-433

  4. Xujin Chen, Leah Epstein, Elena Kleiman, and Rob van Stee
    Maximizing the minimum load: The cost of selfishness
    Theoretical Computer Science 482: 9-19, 2013

  5. Peter Sanders, Johannes Singler, and Rob van Stee
    Real-time prefetching and caching
    Journal of Scheduling 16 (1): 47-58, 2013
    [PDF: Download: fetch.pdf]
  6. Rob van Stee
    SIGACT News Online Algorithms Column 22
    SIGACT News 44 (2): 125 p., 2013
  7. Ho-Leung Chan, Nicole Megow, René Sitters, and Rob van Stee
    A note on sorting buffers offline
    Theoretical Computer Science 423: 11-18, 2012

  8. Rolf Harren and Rob van Stee
    Absolute Approximation Ratios for Packing Rectangles into Bins
    Journal of Scheduling 15 (1): 63-75, 2012
  9. Rob van Stee
    An improved algorithm for online rectangle filling
    Theoretical Computer Science 423: 59-74, 2012

  10. Leah Epstein, Asaf Levin, and Rob van Stee
    Approximation Schemes for Packing Splittable Items with Cardinality Constraints
    Algorithmica 62 (1-2): 102-129, 2012
    [Download: cards-j_revised2.dvi]
  11. Leah Epstein, Lukasz Jez, Jiri Sgall, and Rob van Stee
    Online Scheduling of Jobs with Fixed Start Times on Related Machines
    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

  12. Leah Epstein and Rob van Stee
    The price of anarchy on uniformly related machines revisited
    Information and Computation 212: 37-54, 2012

  13. Xujin Chen, Benjamin Doerr, Xiaodong Hu, Weidong Ma, Rob van Stee, and Carola Winzen
    The Price of Anarchy for Selfish Ring Routing is Two
    In: Internet and Network Economics : 8th International Workshop, WINE 2012, Liverpool, UK, 2012, 420-433

  14. Rob van Stee
    SIGACT News Online Algorithms Column 20: The Power of Harmony
    SIGACT News 43 (2): 127-136, 2012

  15. Rob van Stee
    SIGACT News Online Algorithms Column 21: APPROX and ALGO
    SIGACT News 43 (4): 123-129, 2012

  16. Rolf Harren, Klaus Jansen, Lars Prädel, and Rob van Stee
    A (5/3 + ε)-Approximation for Strip Packing
    In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, New York, NY, 2011, 475-487
    [PDF: Download: strip53.pdf]
  17. Rob van Stee
    An improved algorithm for online rectangle filling
    In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, Liverpool, Great Britain, 2011, 249-260
    [PDF: Download: recfillingJ.pdf]
  18. Leah Epstein and Rob van Stee
    Improved results for a memory allocation problem
    Theory of Computing Systems 48 (1): 79-92, 2011
    [PDF: Download: splitemj9.pdf]
  19. Leah Epstein, Asaf Levin, and Rob van Stee
    Max-min online allocations with a reordering buffer
    SIAM Journal on Discrete Mathematics 25 (3): 1230-1250, 2011
    [Download: bcover_jour2.dvi] [PDF: Download: bcover_jour5_rev_sec.pdf]
  20. Leah Epstein and Rob van Stee
    On the online unit clustering problem
    ACM Transactions on Algorithms 7 (1): 7:1-7:1, 2011
  21. George Christodoulou, Annamaria Kovacs, and Rob van Stee
    A truthful constant approximation for maximizing the minimum load on related machines
    In: Internet and Network Economics : 6th International Workshop, WINE 2010, Stanford, USA, 2010, 182-193
  22. Leah Epstein, Asaf Levin, and Rob van Stee
    Max-min online allocations with a reordering buffer
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, 2010, 336-347

  23. Leah Epstein and Rob van Stee
    Maximizing the minimum load for selfish agents
    Theoretical Computer Science 411 (1): 44-57, 2010
  24. Leah Epstein and Rob van Stee
    On the online unit clustering problem
    ACM Transactions on Algorithms 7 (1): 1-18, 2010

  25. George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, and Rob van Stee
    On the price of stability for undirected network design
    In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, 2010, 86-97
    [Download: networkpos.dvi]
  26. Rolf Harren and Rob van Stee
    Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
    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
  27. Leah Epstein, Elena Kleiman, and Rob van Stee
    Maximizing the Minimum Load: The Cost of Selfishness
    In: Internet and Network Economics : 5th International Workshop, WINE 2009, Rome, Italy, 2009, 232-243
  28. Sven Krumke, Rob van Stee, and Stefan Westphal
    Online job admissions
    In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 2009, 435-454
    [PDF: Download: online-jobs.pdf]
  29. Leah Epstein, Rob van Stee, and Tami Tamir
    Paging with request sets
    Theory of Computing Systems 44 (1): 67-81, 2009
    [PDF: Download: pagesets-j3.pdf]
  30. Leah Epstein, Csanád Imreh, and Rob van Stee
    More on weighted servers or FIFO is better than LRU
    In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, Warsawa-Otwock, Poland, 2002, 257-268
  31. Sven Oliver Krumke, Anne Schwahn, Rob van Stee, and Stephan Westphal
    A monotone approximation algorithm for scheduling with precedence constraints
    Operations Research Letters 36 (2): 247-249, 2008
    [Download: mprecede.dvi]
  32. Leah Epstein and Rob van Stee
    Approximation schemes for packing splittable items with cardinality constraints
    In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, 2008, 232-245
    [PS: Download: cards-j.ps]
  33. Rob van Stee
    Combinatorial algorithms for packing and scheduling problems
    Habilitation thesis, Universität Karlsruhe, 2008
    [PS: Download: habil-embed.ps]
  34. Leah Epstein and Rob van Stee
    Maximizing the minimum load for selfish agents
    In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, 2008, 264-275
    [Download: cover16.dvi]
  35. Leah Epstein and Rob van Stee
    On the Online Unit Clustering Problem
    In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, 2008, 193-206
    [Download: unitj3.dvi]
  36. Leah Epstein, Asaf Levin, and Rob van Stee
    Online unit clustering: Variations on a theme
    Theoretical Computer Science 407 (1-3): 85-96, 2008
    [PDF: Download: unitcard_jour2.pdf]
  37. Rob van Stee
    Packet Switching in Single Buffer
    In: Encyclopedia of Algorithms, 2008, 1-99
    [Download: paging.dvi]
  38. Rolf Harren and Rob van Stee
    Packing Rectangles into 2 OPT Bins using Rotations
    In: 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, 2008, 306-318
    [PDF: Download: Harren,vanStee-SWAT2008.pdf]
  39. Rob van Stee
    Paging
    In: Encyclopedia of Algorithms, 2008, 1-99
    [Download: paging.dvi]
  40. Kirk Pruhs, Rob van Stee, and Patchrawat Uthaisombut
    Speed Scaling of Tasks with Precedence Constraints
    Theory of Computing Systems 43 (1): 67-80, 2008
    [PS: Download: precede-j5.ps]
  41. Leah Epstein and Rob van Stee
    The price of anarchy on uniformly related machines revisited
    In: Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, 2008, 46-57
    [Download: poa-sagt.dvi]
  42. Leah Epstein, Asaf Levin, and Rob van Stee
    Two-dimensional packing with conflicts
    Acta Informatica 45 (3): 155-175, 2008
    [Download: area_perf_jour_revised.dvi]