Browsing by Author "5395a4b8-5981-4395-a8f5-e199d64f5acb"

Now showing items 1-6 of 6

    • A QPTAS for the general scheduling problem with identical release dates 
      Antoniadis, Antonios; Hoeksma, Rubén; Meißner, Julie; Verschae, José; Wiese, Andreas (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
      The General Scheduling Problem (GSP) generalizes scheduling problems with sum of cost objectives such as weighted flow time and weighted tardiness. Given a set of jobs with processing times, release dates, and job dependent ...
    • Approximation algorithms for connected graph factors of minimum weight 
      Cornelissen, Kamiel; Hoeksma, Ruben; Manthey, Bodo; Narayanaswamy, N. S.; Rahul, C. S.; Waanders, Marten (Springer, 2018)
      Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of ...
    • Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope 
      Hoeksma, Ruben; Manthey, Bodo; Uetz, Marc (Elsevier, 2016)
      In a fundamental paper in polyhedral combinatorics, Queyranne describes the complete facial structure of a classical object in combinatorial optimization, the single machine scheduling polytope. In the same paper, he answers ...
    • Network congestion games are robust to variable demand 
      Correa Haeussler, José; Hoeksma, Rubén; Schröder, Marc (Springer, 2017)
      Network congestion games have provided a fertile ground for the algorithmic game theorycommunity. Indeed, many of the pioneering works on bounding the efficiency of equilibria usethis framework as their starting ...
    • Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types 
      Hoeksma, Ruben; Uetz, Marc (Informs, 2016)
      We study the design of mechanisms for a sequencing problem where the types of job-agents consist of processing times and waiting costs that are private to the jobs. In the Bayes-Nash setting, we seek to find a sequencing ...
    • Posted price mechanisms for a random stream of customers 
      Correa Haeussler, Jośe; Foncea, Patricio; Hoeksma, Ruben; Oosterwijk, Tim; Vredeveld, Tjark (Association for Computing Machinery, 2017)
      Posted price mechanisms constitute a widely used way of selling items to strategic consumers. Although subop-timal, the a ractiveness of these mechanisms comes from their simplicity and easy implementation. In this pa-per, ...