Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Jochen
    Last name: Könemann
    DBLP: 78/2452
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 93  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Samuel Fiorini, Martin Groß 0001, Jochen Könemann, Laura Sanità.
    Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts.
    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 2018 (0) 2018
    Journal article
    Stephan Held, Jochen Könemann, Jens Vygen.
    Vehicle Routing with Subtours.
    CoRR 2018, Volume 0 (0) 2018
    Conference paper
    Samuel Fiorini, Martin Groß 0001, Jochen Könemann, Laura Sanità.
    A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi 0001, Chaitanya Swamy, Jens Vygen.
    On the Integrality Gap of the Prize-Collecting Steiner Forest LP.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi 0001, Chaitanya Swamy, Jens Vygen.
    On the Integrality Gap of the Prize-Collecting Steiner Forest LP.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA 2017 (0) 2017
    Journal article
    Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità.
    Lehman's Theorem and the Directed Steiner Tree Problem.
    SIAM J. Discrete Math. 2016, Volume 30 (0) 2016
    Conference paper
    Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità.
    Fast Approximation Algorithms for the Generalized Survivable Network Design Problem.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Zachary Friggstad, Jochen Könemann, Mohammad Shadravan.
    A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Jochen Könemann, Kanstantsin Pashkovich, Justin Toth.
    The Power of Locality: An Elementary Integrality Proof of Rothblum's Stable Matching Formulation.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Zachary Friggstad, Jochen Könemann, Mohammad Shadravan.
    A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs .
    15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland 2016 (0) 2016
    Show item 1 to 10 of 93  

    Your query returned 93 matches in the database.