default search action
Jochen Könemann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j42]Madison Van Dyk, Jochen Könemann:
Sparse dynamic discretization discovery via arc-dependent time discretizations. Comput. Oper. Res. 169: 106715 (2024) - [j41]Jochen Könemann, Justin Toth, Felix Zhou:
On the complexity of nucleolus computation for bipartite b-matching games. Theor. Comput. Sci. 998: 114476 (2024) - [c48]Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow:
Fast Combinatorial Algorithms for Efficient Sortation. IPCO 2024: 418-432 - 2023
- [j40]Cristiana L. Lara, Jochen Könemann, Yisu Nie, Cid C. de Souza:
Scalable timing-aware network design via lagrangian decomposition. Eur. J. Oper. Res. 309(1): 152-169 (2023) - [j39]Jochen Könemann, Justin Toth:
A Framework for Computing the Nucleolus via Dynamic Programming. ACM Trans. Economics and Comput. 11: 3:1-3:21 (2023) - [i28]Madison Van Dyk, Jochen Könemann:
Dynamic discretization discovery under hard node storage constraints. CoRR abs/2303.01419 (2023) - [i27]Madison Van Dyk, Jochen Könemann:
Sparse dynamic discretization discovery via arc-dependent time discretizations. CoRR abs/2305.19176 (2023) - [i26]Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow:
Fast Combinatorial Algorithms for Efficient Sortation. CoRR abs/2311.05094 (2023) - 2022
- [j38]Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. SIAM J. Discret. Math. 36(4): 2830-2862 (2022) - 2021
- [j37]Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann:
Travelling on Graphs with Small Highway Dimension. Algorithmica 83(5): 1352-1370 (2021) - [c47]Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. APPROX-RANDOM 2021: 25:1-25:23 - [c46]Jochen Könemann, Justin Toth, Felix Zhou:
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games. SAGT 2021: 171-185 - [e2]Jochen Könemann, Britta Peis:
Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12982, Springer 2021, ISBN 978-3-030-92701-1 [contents] - [i25]Jochen Könemann, Justin Toth, Felix Zhou:
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games. CoRR abs/2105.07161 (2021) - [i24]Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. CoRR abs/2107.04763 (2021) - 2020
- [j36]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
Computing the nucleolus of weighted cooperative matching games in polynomial time. Math. Program. 183(1): 555-581 (2020) - [c45]Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade:
Approximating Stable Matchings with Ties of Bounded Size. SAGT 2020: 178-192 - [c44]Jochen Könemann, Justin Toth:
A General Framework for Computing the Nucleolus via Dynamic Programming. SAGT 2020: 307-321 - [i23]Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade:
On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap. CoRR abs/2005.05228 (2020) - [i22]Jochen Könemann, Justin Toth:
A General Framework for Computing the Nucleolus Via Dynamic Programming. CoRR abs/2005.10853 (2020)
2010 – 2019
- 2019
- [j35]Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive stabilizers for unstable graphs. Discret. Optim. 31: 56-78 (2019) - [j34]Stephan Held, Jochen Könemann, Jens Vygen:
Vehicle routing with subtours. Discret. Optim. 33: 87-100 (2019) - [c43]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. IPCO 2019: 413-426 - [c42]Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann:
Travelling on Graphs with Small Highway Dimension. WG 2019: 175-189 - [i21]Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann:
Travelling on Graphs with Small Highway Dimension. CoRR abs/1902.07040 (2019) - 2018
- [j33]Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post:
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. SIAM J. Comput. 47(4): 1667-1704 (2018) - [j32]Adam Smith, Jochen Könemann:
Special Section on the Forty-Sixth Annual ACM Symposium on Theory of Computing (STOC 2014). SIAM J. Comput. 47(5): 1807-1808 (2018) - [c41]Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. SODA 2018: 817-831 - [i20]Stephan Held, Jochen Könemann, Jens Vygen:
Vehicle Routing with Subtours. CoRR abs/1801.04991 (2018) - [i19]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. CoRR abs/1803.03249 (2018) - 2017
- [c40]Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen:
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM 2017: 17:1-17:13 - [e1]Friedrich Eisenbrand, Jochen Könemann:
Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings. Lecture Notes in Computer Science 10328, Springer 2017, ISBN 978-3-319-59249-7 [contents] - [i18]Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. CoRR abs/1702.05567 (2017) - [i17]Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen:
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR abs/1706.06565 (2017) - 2016
- [j31]Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità:
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. 160(1-2): 379-406 (2016) - [j30]Linda Farczadi, Konstantinos Georgiou, Jochen Könemann:
Stable Marriage with General Preferences. Theory Comput. Syst. 59(4): 683-699 (2016) - [j29]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
An elementary integrality proof of Rothblum's stable matching formulation. Oper. Res. Lett. 44(6): 754-756 (2016) - [j28]Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità:
Lehman's Theorem and the Directed Steiner Tree Problem. SIAM J. Discret. Math. 30(1): 141-153 (2016) - [c39]Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità:
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. ISAAC 2016: 33:1-33:12 - [c38]Zachary Friggstad, Jochen Könemann, Mohammad Shadravan:
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs . SWAT 2016: 3:1-3:11 - [i16]Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità:
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. CoRR abs/1604.07049 (2016) - [i15]Zachary Friggstad, Jochen Könemann, Mohammad Shadravan:
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs. CoRR abs/1604.08132 (2016) - [i14]Jochen Könemann, Kanstantsin Pashkovich, Justin Toth:
The Power of Locality: An Elementary Integrality Proof of Rothblum's Stable Matching Formulation. CoRR abs/1605.04427 (2016) - [i13]Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive Stabilizers for Unstable Graphs. CoRR abs/1608.06797 (2016) - 2015
- [j27]Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer:
Efficient cost-sharing mechanisms for prize-collecting problems. Math. Program. 152(1-2): 147-188 (2015) - [j26]Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding small stabilizers for unstable graphs. Math. Program. 154(1-2): 173-196 (2015) - [j25]Jochen Könemann, Kate Larson, David Steiner:
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. Theory Comput. Syst. 57(3): 655-672 (2015) - [c37]Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. ESA 2015: 483-495 - [c36]Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post:
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. ICALP (1) 2015: 469-480 - [i12]Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post:
A (1 + ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. CoRR abs/1502.04588 (2015) - [i11]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. CoRR abs/1507.00748 (2015) - 2014
- [j24]Jochen Könemann, Ojas Parekh, David Pritchard:
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation. Algorithmica 68(3): 776-804 (2014) - [j23]Konstantinos Georgiou, George Karakostas, Jochen Könemann, Zuzanna Stamirowska:
Social exchange networks with distant bargaining. Theor. Comput. Sci. 554: 263-274 (2014) - [c35]Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità:
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM 2014: 176-191 - [c34]Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding Small Stabilizers for Unstable Graphs. IPCO 2014: 150-161 - [c33]Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani:
Linear Programming Hierarchies Suffice for Directed Steiner Tree. IPCO 2014: 285-296 - [c32]Linda Farczadi, Konstantinos Georgiou, Jochen Könemann:
Stable Marriage with General Preferences - Extended Abstract. SAGT 2014: 25-36 - [i10]Linda Farczadi, Konstantinos Georgiou, Jochen Könemann:
Stable marriage with general preferences. CoRR abs/1407.1853 (2014) - 2013
- [j22]Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità:
The School Bus Problem on Trees. Algorithmica 67(1): 49-64 (2013) - [j21]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On generalizations of network design problems with degree bounds. Math. Program. 141(1-2): 479-506 (2013) - [j20]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Hypergraphic LP Relaxations for Steiner Trees. SIAM J. Discret. Math. 27(1): 507-533 (2013) - [c31]Konstantinos Georgiou, George Karakostas, Jochen Könemann, Zuzanna Stamirowska:
Social Exchange Networks with Distant Bargaining. COCOON 2013: 29-40 - [c30]Linda Farczadi, Konstantinos Georgiou, Jochen Könemann:
Network Bargaining with General Capacities. ESA 2013: 433-444 - [c29]Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità:
Better Approximation Algorithms for Technology Diffusion. ESA 2013: 637-646 - [c28]Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità:
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. FOCS 2013: 568-577 - [i9]Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità:
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. CoRR abs/1302.2127 (2013) - [i8]Linda Farczadi, Konstantinos Georgiou, Jochen Könemann:
Network bargaining with general capacities. CoRR abs/1306.4302 (2013) - 2012
- [c27]Jochen Könemann, Kate Larson, David Steiner:
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. SAGT 2012: 216-226 - [c26]Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe:
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. SODA 2012: 1576-1585 - [i7]Isaac Fung, Konstantinos Georgiou, Jochen Könemann, Malcolm Sharpe:
Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances. CoRR abs/1202.5049 (2012) - [i6]Jochen Könemann, Kate Larson, David Steiner:
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. CoRR abs/1207.6683 (2012) - 2011
- [j19]Jochen Könemann, Ojas Parekh, Danny Segev:
A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011) - [j18]Jochen Könemann, David Pritchard, Kunlun Tan:
A partition-based relaxation for Steiner trees. Math. Program. 127(2): 345-370 (2011) - [c25]Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità:
The School Bus Problem on Trees. ISAAC 2011: 10-19 - [p2]Jochen Könemann:
Winning Strategies for a Matchstick Game. Algorithms Unplugged 2011: 259-265 - 2010
- [j17]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. 38(6): 567-570 (2010) - [j16]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer:
Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39(8): 3616-3632 (2010) - [c24]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123 - [c23]Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann:
On Column-Restricted and Priority Covering Integer Programs. IPCO 2010: 355-368 - [c22]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Hypergraphic LP Relaxations for Steiner Trees. IPCO 2010: 383-396 - [i5]Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann:
On Column-restricted and Priority Covering Integer Programs. CoRR abs/1003.1507 (2010) - [i4]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. CoRR abs/1003.2977 (2010) - [i3]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 abs/1006.2249 (2010)
2000 – 2009
- 2009
- [i2]Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Hypergraphic LP Relaxations for Steiner Trees. CoRR abs/0910.0281 (2009) - 2008
- [j15]Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann:
On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4): 399-401 (2008) - [j14]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. 37(5): 1319-1341 (2008) - [j13]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio:
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38(3): 825-840 (2008) - [j12]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi:
Distributed weighted vertex cover via maximal matchings. ACM Trans. Algorithms 5(1): 6:1-6:12 (2008) - [c21]Jochen Könemann, Ojas Parekh, David Pritchard:
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA 2008: 1-14 - [p1]Jochen Könemann:
Gewinnstrategie für ein Streichholzspiel. Taschenbuch der Algorithmen 2008: 267-273 - 2007
- [j11]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2): 262-279 (2007) - [j10]Naveen Garg, Jochen Könemann:
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. SIAM J. Comput. 37(2): 630-652 (2007) - [j9]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Trans. Algorithms 3(2): 23 (2007) - [c20]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 - [i1]Jochen Könemann, David Pritchard, Kunlun Tan:
A Partition-Based Relaxation For Steiner Trees. CoRR abs/0712.3568 (2007) - 2006
- [c19]Jochen Könemann, Ojas Parekh, Danny Segev:
A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479 - [c18]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut Problems in Graphs with a Budget Constraint. LATIN 2006: 435-446 - [c17]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: 663-670 - 2005
- [j8]Jochen Könemann, Asaf Levin, Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41(2): 117-129 (2005) - [j7]Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella:
Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005) - [j6]Jochen Könemann, R. Ravi:
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. SIAM J. Comput. 34(3): 763-773 (2005) - [c16]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi:
Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848 - [c15]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: 930-942 - [c14]Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio:
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125 - [c13]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA 2005: 375-384 - [c12]Jochen Könemann, Stefano Leonardi, Guido Schäfer:
A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619 - 2004
- [j5]Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha:
Improved Approximations for Tour and Tree Covers. Algorithmica 38(3): 441-449 (2004) - [j4]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha:
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004) - [j3]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) - [j2]Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha:
An approximation algorithm for the edge-dilation k-center problem, . Oper. Res. Lett. 32(5): 491-495 (2004) - 2003
- [c11]Jochen Könemann, R. Ravi:
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. FSTTCS 2003: 289-301 - [c10]Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha:
Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35 - [c9]Jochen Könemann, Asaf Levin, Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. RANDOM-APPROX 2003: 109-121 - [c8]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: 517-522 - [c7]Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha:
Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270 - [c6]Jochen Könemann, R. Ravi:
Primal-dual meets local search: approximating MST's with nonuniform degree bounds. STOC 2003: 389-395 - 2002
- [j1]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) - [c5]Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha:
Approximation Algorithms for Edge-Dilation k-Center Problems. SWAT 2002: 210-219 - 2000
- [c4]