Jochen Koenemann
TitleCited byYear
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
N Garg, J Koenemann
SIAM Journal on Computing 37 (2), 630-652, 2007
8712007
A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees
J Könemann, R Ravi
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
1192000
Exact geometric computation in LEDA
C Burnikel, J Könemann, K Mehlhorn, S Näher, S Schirra, C Uhrig
Proceedings of the eleventh annual symposium on Computational geometry, 418-419, 1995
911995
Primal-Dual meets local search: approximating MSTs with nonuniform degree bounds
J Könemann, R Ravi
SIAM Journal on Computing 34 (3), 763-773, 2005
892005
Min–max tree covers of graphs
G Even, N Garg, J Könemann, R Ravi, A Sinha
Operations Research Letters 32 (4), 309-315, 2004
852004
A group-strategyproof mechanism for Steiner forests
J Könemann, S Leonardi, G Schäfer
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
742005
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
TM Chan, E Grant, J Könemann, M Sharpe
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
702012
Approximation algorithms for network design: A survey
A Gupta, J Könemann
Surveys in Operations Research and Management Science 16 (1), 3-20, 2011
532011
Approximating k-hop minimum-spanning trees
E Althaus, S Funke, S Har-Peled, J Könemann, EA Ramos, M Skutella
Operations Research Letters 33 (2), 115-120, 2005
512005
Distributed weighted vertex cover via maximal matchings
F Grandoni, J Könemann, A Panconesi
ACM Transactions on Algorithms (TALG) 5 (1), 1-12, 2008
452008
Distributed weighted vertex cover via maximal matchings
F Grandoni, J Könemann, A Panconesi
ACM Transactions on Algorithms (TALG) 5 (1), 1-12, 2008
452008
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
A Gupta, J Könemann, S Leonardi, R Ravi, G Schäfer
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
442007
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner tree
L Fleischer, J Könemann, S Leonardi, G Schäfer
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
442006
On column-restricted and priority covering integer programs
D Chakrabarty, E Grant, J Könemann
International Conference on Integer Programming and Combinatorial …, 2010
422010
From primal-dual to cost shares and back: a stronger LP relaxation for the Steiner forest problem
J Könemann, S Leonardi, G Schäfer, S van Zwam
International Colloquium on Automata, Languages, and Programming, 930-942, 2005
412005
Non-clairvoyant scheduling for minimizing mean slowdown
N Bansal, K Dhamdhere, J Könemann, A Sinha
Algorithmica 40 (4), 305-318, 2004
412004
Scheduling to minimize average stretch without migration.
L Becchetti, S Leonardi, S Muthukrishnan
SODA, 548-557, 2000
412000
A unified approach to approximating partial covering problems
J Könemann, O Parekh, D Segev
Algorithmica 59 (4), 489-509, 2011
402011
Approximating the degree-bounded minimum diameter spanning tree problem
J Könemann, A Levin, A Sinha
Algorithmica 41 (2), 117-129, 2005
402005
A group-strategyproof cost sharing mechanism for the Steiner forest game
J Könemann, S Leonardi, G Schäfer, SHM van Zwam
SIAM Journal on Computing 37 (5), 1319-1341, 2008
352008
The system can't perform the operation now. Try again later.
Articles 1–20