dblp.uni-trier.dewww.uni-trier.de

Jochen Könemann Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
39EEDeeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees CoRR abs/0910.0281: (2009)
2008
38EEJochen Könemann, Ojas Parekh, David Pritchard: Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA 2008: 1-14
37EEJochen Könemann: Gewinnstrategie für ein Streichholzspiel. Taschenbuch der Algorithmen 2008: 267-273
36EEFabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms 5(1): (2008)
35EEJoseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4): 399-401 (2008)
34EEJochen 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)
33EEFabrizio 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)
2007
32EEAnupam 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
31EELuca 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)
30EEJochen Könemann, David Pritchard, Kunlun Tan: A Partition-Based Relaxation For Steiner Trees CoRR abs/0712.3568: (2007)
29EERoee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor: Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2): 262-279 (2007)
28EENaveen Garg, Jochen Könemann: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. SIAM J. Comput. 37(2): 630-652 (2007)
2006
27EEJochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479
26EERoee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor: Cut Problems in Graphs with a Budget Constraint. LATIN 2006: 435-446
25EELisa 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
24EEFabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848
23EEJochen 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
22EEFabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125
21EELuca 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
20EEJochen Könemann, Stefano Leonardi, Guido Schäfer: A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619
19EEErnst 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)
18EEJochen Könemann, R. Ravi: Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. SIAM J. Comput. 34(3): 763-773 (2005)
2004
17EENikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004)
16EEJochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41(2): 117-129 (2004)
15EEGuy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Min-max tree covers of graphs. Oper. Res. Lett. 32(4): 309-315 (2004)
14EEJochen 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
13EEJochen Könemann, R. Ravi: Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. FSTTCS 2003: 289-301
12EEJochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. RANDOM-APPROX 2003: 109-121
11EEGuy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35
10EEFriedrich 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
9EENikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270
8EEJochen Könemann, R. Ravi: Primal-dual meets local search: approximating MST's with nonuniform degree bounds. STOC 2003: 389-395
7EEJochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved Approximations for Tour and Tree Covers. Algorithmica 38(3): 441-449 (2003)
2002
6EEJochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha: Approximation Algorithms for Edge-Dilation k-Center Problems. SWAT 2002: 210-219
5EEJochen 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)
2000
4EEJochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved approximations for tour and tree covers. APPROX 2000: 184-193
3EEJochen Könemann, R. Ravi: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. STOC 2000: 537-546
1998
2EENaveen Garg, Jochen Könemann: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. FOCS 1998: 300-309
1995
1EEChristoph 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

1Ernst Althaus [19]
2Nikhil Bansal [9] [17]
3Luca Becchetti [21] [31]
4Christoph Burnikel [1]
5Deeparnab Chakrabarty [39]
6Joseph Cheriyan [35]
7Kedar Dhamdhere [9] [17]
8Friedrich Eisenbrand [10]
9Roee Engelberg [26] [29]
10Guy Even [11] [15]
11Lisa Fleischer [25]
12Stefan Funke [10] [19]
13Naveen Garg [2] [10] [11] [15] [28]
14Fabrizio Grandoni [22] [24] [33] [36]
15Anupam Gupta [32]
16Sariel Har-Peled [19]
17Howard J. Karloff [35]
18Rohit Khandekar [35]
19Goran Konjevod [4] [7]
20Stefano Leonardi [20] [21] [23] [25] [26] [29] [31] [32] [34]
21Asaf Levin [12] [16]
22Yanjun Li [6] [14]
23Kurt Mehlhorn [1]
24Stefan Näher [1]
25Joseph Naor (Seffi Naor) [26] [29]
26Martin Pál (Martin Pal) [21] [31]
27Alessandro Panconesi [22] [24] [33] [36]
28Ojas Parekh [4] [6] [7] [14] [27] [38]
29David Pritchard [30] [38] [39]
30Edgar A. Ramos [19]
31R. Ravi [3] [5] [8] [11] [13] [15] [18] [32]
32Guido Schäfer [20] [23] [25] [32] [34]
33Stefan Schirra [1]
34Danny Segev [27]
35Amitabh Sinha [4] [6] [7] [9] [11] [12] [14] [15] [16] [17]
36Martin Skutella [19]
37Mauro Sozio [22] [33]
38Kunlun Tan [30]
39Christian Uhrig [1]
40Stefan H. M. van Zwam [23] [34]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)