Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Jochen Könemann
Observed names:
J KONEMANN,
J. Konemann,
J. Könemann,
Jochen Konemann,
Konemann, Jochen,
Könemann, Jochen
show all 6
Institution:
University of Waterloo
Observed institutions:
Max Planck Society,
University of Waterloo,
Max Planck Institute for Informatics,
HUN-REN Institute for Computer Science and Control,
Carnegie Mellon University,
Hungarian Academy of Sciences,
Saarland University
show all 7
ORCID:
0000-0003-0715-8516
Observed ORCID:
0000-0003-0715-8516
OpenAlex ID:
A5111545821
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
2002
·
N. Garg
, J. Konemann
·
Annual Symposium on Foundations of Computer Science
·
561
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
2007
·
Naveen Garg
, Jochen Könemann
·
SIAM Journal on Computing
·
310
PDF
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
2002
·
J. Könemann
, R. Ravi
·
SIAM Journal on Computing
·
149
Min–max tree covers of graphs
2004
·
G. Even
, N. Garg
, et al.
·
Operations Research Letters
·
125
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
2012
·
Timothy M. Chan
, Elyot Grant
, et al.
·
85
A Unified Approach to Approximating Partial Covering Problems
2009
·
Jochen Könemann
, Ojas Parekh
, et al.
·
Algorithmica
·
80
A group-strategyproof mechanism for Steiner forests
2005
·
Jochen Könemann
, Stefano Leonardi
, et al.
·
61
Approximation algorithms for network design: A survey
2010
·
Anupam Gupta
, Jochen Könemann
·
Surveys in Operations Research and Management Science
·
58
Approximating k-hop minimum-spanning trees
2004
·
Ernst Althaus
, Stefan Funke
, et al.
·
Operations Research Letters
·
58
A Gentle Introduction to Optimization
2014
·
B. Guenin
, J. Könemann
, et al.
·
Cambridge University Press eBooks
·
57
Exact geometric computation in LEDA
1995
·
C. Burnikel
, J. Könemann
, et al.
·
Annual Symposium on Computational Geometry (SoCG)
·
56
PDF
Primal-dual meets local search
2003
·
Jochen Könemann
, R. Ravi
·
ACM Symposium on Theory of Computing (STOC)
·
53
On the integrality ratio for tree augmentation
2008
·
J. Cheriyan
, H. Karloff
, et al.
·
Operations Research Letters
·
52
Weighted Capacitated, Priority, and Geometric Set Cover via Improved Quasi-Uniform Sampling
2012
·
Timothy M. Chan
, Elyot Grant
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
49
On Column-Restricted and Priority Covering Integer Programs
2010
·
Deeparnab Chakrabarty
, Elyot Grant
, et al.
·
Lecture notes in computer science
·
44
PDF
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
2005
·
J. Könemann
, R. Ravi
·
SIAM Journal on Computing
·
43
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
2004
·
Jochen Könemann
, Asaf Levin
, et al.
·
Algorithmica
·
41
PDF
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
2008
·
Jochen Könemann
, Stefano Leonardi
, et al.
·
SIAM Journal on Computing
·
40
Distributed weighted vertex cover via maximal matchings
2008
·
Fabrizio Grandoni
, Jochen Könemann
, et al.
·
ACM Transactions on Algorithms
·
38
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
2006
·
Lisa Fleischer
, Jochen Könemann
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
36
PDF
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
2004
·
Nikhil Bansal
, Kedar Dhamdhere
, et al.
·
Algorithmica
·
36
A matter of degree
2000
·
J. Könemann
, R. Ravi
·
ACM Symposium on Theory of Computing (STOC)
·
36
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts
2018
·
Samuel Fiorini
, Martin Groß
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
35
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem
2005
·
Jochen Könemann
, Stefano Leonardi
, et al.
·
Lecture notes in computer science
·
34
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
2007
·
Anupam Gupta
, Jochen Könemann
, et al.
·
32
Show more works
View as search
Works count:
116
Citation count:
2,836
H-index:
27
I10-index:
51
Year
Topic
Type
