Browsing by Author "7abf4eb6-ed17-4ef7-a0aa-b18aea3ed4fc"

Now showing items 1-2 of 2

    • 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 ...