( en | de | ru )

 

Disambiguation of "Könemann, Jochen"

Author of the publication

copydeleteadd this publication to your clipboard
Approximate Deadline-Scheduling with Precedence Constraints.

, , , , , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 483-495. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stephanie Könemann

Kai Könemann

Peter Könemann

Regina Könemann

Stefan Könemann

 

Other publications of authors with the same name

Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances, , , and . CoRR, (2012)A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees., and . STOC, page 537-546. ACM, (2000)Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees., and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 289-301. Springer, (2003)Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances., , and . Theory Comput. Syst., 57 (3): 655-672 (2015)A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs ., , and . SWAT, volume 53 of LIPIcs, page 3:1-3:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A General Framework for Computing the Nucleolus via Dynamic Programming., and . SAGT, volume 12283 of Lecture Notes in Computer Science, page 307-321. Springer, (2020)Sparse dynamic discretization discovery via arc-dependent time discretizations., and . CoRR, (2023)Dynamic discretization discovery under hard node storage constraints., and . CoRR, (2023)Fast Combinatorial Algorithms for Efficient Sortation., , , and . CoRR, (2023)Approximate Deadline-Scheduling with Precedence Constraints., , , , , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 483-495. Springer, (2015)