MPI-INF D1 Publications

Search the publication database

Your search returned the following 15 documents:

  1. A note on sorting buffers offline
    Ho-Leung Chan, Nicole Megow, René Sitters, and Rob van Stee
    Theoretical Computer Science 423: 11-18, 2012

  2. On the complexity of the highway problem
    Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and René Sitters
    Theoretical Computer Science 460: 70-77, 2012
  3. Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
    Khaled Elbassioni, Aleksei V. Fishkin, and René Sitters
    International Journal of Computational Geometry & Applications 19 (2): 173-193, 2009
  4. On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
    Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
    In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, Paphos, Cyprus, 2009, 275-286
    [PDF: Download: 0901.1140v2.pdf]
  5. On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
    Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009, 1210-1219, paper no. 12.B.
  6. A Quasi-PTAS for Envy-free Pricing on Line Graphs
    Khaled M. Elbassioni, Rene Sitters, and Yan Zhang

    [PS: Download:]
  7. A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
    Khaled Elbassioni, Rene Sitters, and Yan Zhang
    In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, Eilat, Israel, 2007, 451-462
  8. How to Sell a Graph: Guidelines for Graph Retailers
    Alexander Grigoriev, Joyce van Loon, Rene Sitters, and Marc Uetz
    In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, Bergen, Norway, 2006, 125-136
  9. On Approximating the TSP with Intersecting Neighborhoods
    Khaled M. Elbassioni, Aleksei V. Fishkin, and Rene Sitters
    In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, 2006, 213-222
  10. On the minimum corridor connection and other generalized geometric problems
    Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, Rene Sitters, and Thomas Wolle
    In: 4th Workshop on Approximation and Online Algorithms, WAOA, Zurich, Switzerland, 2006, 69-82
  11. 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
  12. The general two-server problem
    Rene Sitters and Leen Stougie
    Journal of the ACM 53 (3): 437-458, 2006
  13. The geometric generalized minimum spanning tree problem with grid clustering
    Corinne Feremans, Alexander Grigoriev, and Rene Sitters
    4OR: A Quarterly Journal of Operations Research 4 (4): 319-329, 2006
  14. Approximation algorithms for Euclidean Group TSP
    Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, and Rene Sitters
    In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 1115-1126
  15. Complexity of preemptive minsum scheduling on unrelated parallel machines
    Rene Sitters
    Journal of Algorithms 57 (1): 37-48, 2005