Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jochen Könemann
2010 – today
- 2013
[j20]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. SIAM J. Discrete Math. 27(1): 507-533 (2013)- [c28]Konstantinos Georgiou, George Karakostas, Jochen Könemann, Zuzanna Stamirowska: Social Exchange Networks with Distant Bargaining. COCOON 2013: 29-40
- [i8]Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità: An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. CoRR abs/1302.2127 (2013)
- 2012
- [c27]Jochen Könemann, Kate Larson, David Steiner: Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. SAGT 2012: 216-226
- [c26]Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. SODA 2012: 1576-1585
- [i7]Isaac Fung, Konstantinos Georgiou, Jochen Könemann, Malcolm Sharpe: Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances. CoRR abs/1202.5049 (2012)
- [i6]Jochen Könemann, Kate Larson, David Steiner: Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. CoRR abs/1207.6683 (2012)
- 2011
- [j19]Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011)
- [j18]Jochen Könemann, David Pritchard, Kunlun Tan: A partition-based relaxation for Steiner trees. Math. Program. 127(2): 345-370 (2011)
- [c25]Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità: The School Bus Problem on Trees. ISAAC 2011: 10-19
- [p2]
- 2010
- [j17]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Oper. Res. Lett. 38(6): 567-570 (2010)
- [j16]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer: Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39(8): 3616-3632 (2010)
- [c24]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123
- [c23]Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-Restricted and Priority Covering Integer Programs. IPCO 2010: 355-368
- [c22]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. IPCO 2010: 383-396
- [i5]Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-restricted and Priority Covering Integer Programs. CoRR abs/1003.1507 (2010)
- [i4]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. CoRR abs/1003.2977 (2010)
- [i3]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound. CoRR abs/1006.2249 (2010)
2000 – 2009
- 2009
- [i2]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. CoRR abs/0910.0281 (2009)
- 2008
- [j15]Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4): 399-401 (2008)
- [j14]Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam: A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. SIAM J. Comput. 37(5): 1319-1341 (2008)
- [j13]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38(3): 825-840 (2008)
- [j12]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms 5(1) (2008)
- [c21]Jochen Könemann, Ojas Parekh, David Pritchard: Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA 2008: 1-14
- [p1]Jochen Könemann: Gewinnstrategie für ein Streichholzspiel. Taschenbuch der Algorithmen 2008: 267-273
- 2007
- [j11]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor: Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2): 262-279 (2007)
- [j10]Naveen Garg, Jochen Könemann: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. SIAM J. Comput. 37(2): 630-652 (2007)
- [j9]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál: Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Transactions on Algorithms 3(2) (2007)
- [c20]Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162
- [i1]Jochen Könemann, David Pritchard, Kunlun Tan: A Partition-Based Relaxation For Steiner Trees. CoRR abs/0712.3568 (2007)
- 2006
- [c19]Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479
- [c18]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor: Cut Problems in Graphs with a Budget Constraint. LATIN 2006: 435-446
- [c17]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer: Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC 2006: 663-670
- 2005
- [j8]Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella: Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005)
- [j7]Jochen Könemann, R. Ravi: Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. SIAM J. Comput. 34(3): 763-773 (2005)
- [c16]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848
- [c15]Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam: From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. ICALP 2005: 930-942
- [c14]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125
- [c13]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál: Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA 2005: 375-384
- [c12]Jochen Könemann, Stefano Leonardi, Guido Schäfer: A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619
- 2004
- [j6]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004)
- [j5]Jochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41(2): 117-129 (2004)
- [j4]Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Min-max tree covers of graphs. Oper. Res. Lett. 32(4): 309-315 (2004)
- [j3]Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha: An approximation algorithm for the edge-dilation k-center problem, . Oper. Res. Lett. 32(5): 491-495 (2004)
- 2003
- [j2]Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved Approximations for Tour and Tree Covers. Algorithmica 38(3): 441-449 (2003)
- [c11]Jochen Könemann, R. Ravi: Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. FSTTCS 2003: 289-301
- [c10]Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35
- [c9]Jochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. RANDOM-APPROX 2003: 109-121
- [c8]Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann: A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. SODA 2003: 517-522
- [c7]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270
- [c6]
- 2002
- [j1]Jochen Könemann, R. Ravi: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees. SIAM J. Comput. 31(6): 1783-1793 (2002)
- [c5]Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha: Approximation Algorithms for Edge-Dilation k-Center Problems. SWAT 2002: 210-219
- 2000
- [c4]Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved approximations for tour and tree covers. APPROX 2000: 184-193
- [c3]
1990 – 1999
- 1998
- [c2]Naveen Garg, Jochen Könemann: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. FOCS 1998: 300-309
- 1995
- [c1]Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Exact Geometric Computation in LEDA. Symposium on Computational Geometry 1995: C18-C19
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-24 02:53 CEST by the dblp team