Jochen Koenemann
Cited by
Cited by
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
N Garg, J Könemann
SIAM Journal on Computing 37 (2), 630-652, 2007
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
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
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
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
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
J Könemann, R Ravi
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
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
Approximation algorithms for network design: A survey
A Gupta, J Könemann
Surveys in Operations Research and Management Science 16 (1), 3-20, 2011
A gentle introduction to optimization
B Guenin, J Könemann, L Tuncel
Cambridge University Press, 2014
A unified approach to approximating partial covering problems
J Könemann, O Parekh, D Segev
Algorithmica 59 (4), 489-509, 2011
On the integrality ratio for tree augmentation
J Cheriyan, H Karloff, R Khandekar, J Könemann
Operations Research Letters 36 (4), 399-401, 2008
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
Distributed weighted vertex cover via maximal matchings
F Grandoni, J Könemann, A Panconesi
ACM Transactions on Algorithms (TALG) 5 (1), 1-12, 2008
Approximating weighted tree augmentation via Chvátal-Gomory cuts
S Fiorini, M Groß, J Könemann, L Sanità
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
On column-restricted and priority covering integer programs
D Chakrabarty, E Grant, J Könemann
Integer Programming and Combinatorial Optimization: 14th International …, 2010
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
A Gupta, J Könemann, S Leonardi, R Ravi, G Schäfer
SODA 7, 1153-1162, 2007
Non-clairvoyant scheduling for minimizing mean slowdown
N Bansal, K Dhamdhere, J Könemann, A Sinha
Algorithmica 40, 305-318, 2004
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
Approximating the degree-bounded minimum diameter spanning tree problem
J Könemann, A Levin, A Sinha
Algorithmica 41, 117-129, 2005
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
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
The system can't perform the operation now. Try again later.
Articles 1–20