| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 32 |       | 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 |
| 18 | | Jochen Könemann, R. Ravi: Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. SIAM J. Comput. 34(3): 763-773 (2005) |
| 15 | | 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) |
| 13 | | Jochen Könemann, R. Ravi: Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. FSTTCS 2003: 289-301 |
| 11 | | Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35 |
| 8 | | Jochen Könemann, R. Ravi: Primal-dual meets local search: approximating MST's with nonuniform degree bounds. STOC 2003: 389-395 |
| 5 | | 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) |
| 3 | | Jochen Könemann, R. Ravi: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. STOC 2000: 537-546 |
Selection of 8 from 53 records - Jochen Könemann has 49 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page