|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 27 occurrences of 15 keywords
|
|
|
|
|
Results
Found 53 publication records. Showing 53 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Isaac Fung, Konstantinos Georgiou, Jochen Könemann, Malcolm Sharpe |
Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe |
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jochen Könemann, Ojas Parekh, Danny Segev |
A Unified Approach to Approximating Partial Covering Problems. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, David Pritchard, Kunlun Tan |
A partition-based relaxation for Steiner trees. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann |
Winning Strategies for a Matchstick Game. |
Algorithms Unplugged |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità |
The School Bus Problem on Trees. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard |
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard |
Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis |
On Generalizations of Network Design Problems with Degree Bounds |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann |
On Column-restricted and Priority Covering Integer Programs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer |
Strict Cost Sharing Schemes for Steiner Forest. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis |
On Generalizations of Network Design Problems with Degree Bounds. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard |
Hypergraphic LP Relaxations for Steiner Trees. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann |
On Column-Restricted and Priority Covering Integer Programs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard |
Hypergraphic LP Relaxations for Steiner Trees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann |
On the integrality ratio for tree augmentation. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi |
Distributed weighted vertex cover via maximal matchings. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithms, distributed algorithms, vertex cover, maximal matching |
| 1 | Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio |
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann |
Gewinnstrategie für ein Streichholzspiel. |
Taschenbuch der Algorithmen |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Ojas Parekh, David Pritchard |
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca 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 |
2007 |
DBLP DOI BibTeX RDF |
Steiner forests, Approximation algorithms, network design, cost sharing |
| 1 | Jochen Könemann, David Pritchard, Kunlun Tan |
A Partition-Based Relaxation For Steiner Trees |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Naveen Garg, Jochen Könemann |
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor |
Cut problems in graphs with a budget constraint. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Ojas Parekh, Danny Segev |
A Unified Approach to Approximating Partial Covering Problems. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor |
Cut Problems in Graphs with a Budget Constraint. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer |
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, stochastic optimization, cost sharing |
| 1 | Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella |
Approximating k-hop minimum-spanning trees. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, R. Ravi |
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál |
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Stefano Leonardi, Guido Schäfer |
A group-strategyproof mechanism for Steiner forests. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio |
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, distributed algorithms, vertex cover, primal-dual algorithms |
| 1 | Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi |
Distributed Weighted Vertex Cover via Maximal Matchings. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha |
An approximation algorithm for the edge-dilation k-center problem, . |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha |
Min-max tree covers of graphs. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha |
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Non-clairvoyant algorithms, Resourcelinebreak[4] augmentation, Scheduling, Online algorithms, Slowdown |
| 1 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation |
| 1 | Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha |
Improved Approximations for Tour and Tree Covers. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Graph algorithms, Network design |
| 1 | Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann |
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha |
Non-clairvoyant Scheduling for Minimizing Mean Slowdown. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha |
Covering Graphs Using Trees and Stars. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, R. Ravi |
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, R. Ravi |
Primal-dual meets local search: approximating MST's with nonuniform degree bounds. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation |
| 1 | Jochen Könemann, R. Ravi |
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha |
Approximation Algorithms for Edge-Dilation k-Center Problems. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha |
Improved approximations for tour and tree covers. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Könemann, R. Ravi |
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Naveen Garg, Jochen Könemann |
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig |
Exact Geometric Computation in LEDA. |
Symposium on Computational Geometry |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #53 of 53 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")