×

zbMATH — the first resource for mathematics

Könemann, Jochen

Compute Distance To:
Author ID: konemann.jochen Recent zbMATH articles by "Könemann, Jochen"
Published as: Könemann, Jochen; Könemann, J.; Koenemann, Jochen
External Links: MGP
Documents Indexed: 79 Publications since 2000, including 2 Books

Publications by Year

Citations contained in zbMATH Open

66 Publications have been cited 376 times in 300 Documents Cited by Year
Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Zbl 1137.90014
Garg, Naveen; Könemann, Jochen
32
2007
Min-max tree covers of graphs. Zbl 1054.90079
Even, G.; Garg, N.; Könemann, J.; Ravi, R.; Sinha, A.
25
2004
A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. Zbl 1008.68162
Könemann, J.; Ravi, R.
21
2002
On column-restricted and priority covering integer programs. Zbl 1285.90014
Chakrabarty, Deeparnab; Grant, Elyot; Könemann, Jochen
18
2010
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. Zbl 1421.68198
Chan, Timothy M.; Grant, Elyot; Könemann, Jochen; Sharpe, Malcolm
18
2012
A unified approach to approximating partial covering problems. Zbl 1211.68511
Könemann, Jochen; Parekh, Ojas; Segev, Danny
17
2011
A group-strategyproof cost sharing mechanism for the Steiner forest game. Zbl 1225.68272
Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido; van Zwam, Stefan H. M.
14
2008
Approximating \(k\)-hop minimum-spanning trees. Zbl 1099.90064
Althaus, Ernst; Funke, Stefan; Har-Peled, Sariel; Könemann, Jochen; Ramos, Edgar A.; Skutella, Martin
12
2005
On the integrality ratio for tree augmentation. Zbl 1155.90466
Cheriyan, J.; Karloff, H.; Khandekar, R.; Könemann, J.
12
2008
On generalizations of network design problems with degree bounds. Zbl 1295.90059
Bansal, Nikhil; Khandekar, Rohit; Könemann, Jochen; Nagarajan, Viswanath; Peis, Britta
11
2013
Primal-dual meets local search: approximating MSTs with nonuniform degree bounds. Zbl 1075.68101
Könemann, J.; Ravi, R.
11
2005
Finding small stabilizers for unstable graphs. Zbl 1337.05085
Bock, Adrian; Chandrasekaran, Karthekeyan; Könemann, Jochen; Peis, Britta; Sanità, Laura
10
2015
A primal-dual bicriteria distributed algorithm for capacitated vertex cover. Zbl 1187.68707
Grandoni, F.; Könemann, J.; Panconesi, A.; Sozio, M.
9
2008
A group-strategyproof mechanism for Steiner forests. Zbl 1297.91017
Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido
9
2005
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. Zbl 1302.90235
Gupta, A.; Könemann, J.; Leonardi, S.; Ravi, R.; Schäfer, G.
8
2007
Primal-dual meets local search: approximating MST’s with nonuniform degree bounds. Zbl 1192.90232
Könemann, Jochen; Ravi, R.
8
2003
Improved approximations for tour and tree covers. Zbl 1138.68666
Könemann, Jochen; Konjevod, Goran; Parekh, Ojas; Sinha, Amitabh
7
2004
Cut problems in graphs with a budget constraint. Zbl 1135.90419
Engelberg, Roee; Könemann, Jochen; Leonardi, Stefano; Naor, Joseph (Seffi)
7
2007
Approximating weighted tree augmentation via Chvátal-Gomory cuts. Zbl 1403.68347
Fiorini, Samuel; Groß, Martin; Könemann, Jochen; Sanità, Laura
7
2018
Approximating the degree-bounded minimum diameter spanning tree problem. Zbl 1082.68085
Könemann, Jochen; Levin, Asaf; Sinha, Amitabh
6
2005
A unified approach to approximating partial covering problems. Zbl 1131.90443
Könemann, Jochen; Parekh, Ojas; Segev, Danny
6
2006
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. Zbl 1301.68271
Fleischer, Lisa; Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido
6
2006
Network bargaining: using approximate blocking sets to stabilize unstable instances. Zbl 1327.91019
Könemann, Jochen; Larson, Kate; Steiner, David
6
2015
Linear programming hierarchies suffice for directed Steiner tree. Zbl 1418.90223
Friggstad, Zachary; Könemann, Jochen; Kun-Ko, Young; Louis, Anand; Shadravan, Mohammad; Tulsiani, Madhur
5
2014
Cut problems in graphs with a budget constraint. Zbl 1145.05321
Engelberg, Roee; Könemann, Jochen; Leonardi, Stefano; Naor, Joseph (Seffi)
5
2006
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. Zbl 1296.68195
Könemann, J.; Ravi, R.
5
2000
A combinatorial algorithm for computing a maximum independent set in a \(t\)-perfect graph. Zbl 1092.68623
Eisenbrand, Friedrich; Funke, Stefan; Garg, Naveen; Könemann, Jochen
4
2003
A \((1+{\varepsilon})\) -embedding of low highway dimension graphs into bounded treewidth graphs. Zbl 1398.68671
Feldmann, Andreas Emil; Fung, Wai Shing; Könemann, Jochen; Post, Ian
4
2015
Stable marriage with general preferences. Zbl 1356.91072
Farczadi, Linda; Georgiou, Konstantinos; Könemann, Jochen
4
2016
Improved approximations for tour and tree covers. Zbl 0976.05063
Könemann, Jochen; Konjevod, Goran; Parekh, Ojas; Sinha, Amitabh
4
2000
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. Zbl 1314.68156
Grandoni, F.; Könemann, J.; Panconesi, A.; Sozio, M.
4
2005
Non-clairvoyant scheduling for minimizing mean slowdown. Zbl 1035.68504
Bansal, N.; Dhamdhere, K.; Könemann, J.; Sinha, A.
3
2003
Non-clairvoyant scheduling for minimizing mean slowdown. Zbl 1082.68010
Bansal, Nikhil; Dhamdhere, Kedar; Könemann, Jochen; Sinha, Amitabh
3
2004
Lehman’s theorem and the directed Steiner tree problem. Zbl 1336.90107
Abdi, Ahmad; Feldmann, Andreas Emil; Guenin, Bertrand; Könemann, Jochen; Sanità, Laura
3
2016
From primal-dual to cost shares and back: A stronger LP relaxation for the Steiner forest problem. Zbl 1084.90525
Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido; van Zwam, Stefan
3
2005
A partition-based relaxation for Steiner trees. Zbl 1222.68413
Könemann, Jochen; Pritchard, David; Tan, Kunlun
3
2011
Hypergraphic LP relaxations for Steiner trees. Zbl 1285.90046
Chakrabarty, Deeparnab; Könemann, Jochen; Pritchard, David
3
2010
Sharing the cost more efficiently, improved approximation for multicommodity rent-or-buy. Zbl 1297.90010
Becchetti, Luca; Könemann, Jochen; Leonardi, Stefano; Pál, M.
3
2005
Approximation algorithms for edge-dilation \(k\)-center problems. Zbl 1078.68828
Könemann, Jochen; Li, Yanjun; Parekh, Ojas; Sinha, Amitabh
2
2002
Finding small stabilizers for unstable graphs. Zbl 1410.91017
Bock, Adrian; Chandrasekaran, Karthekeyan; Könemann, Jochen; Peis, Britta; Sanità, Laura
2
2014
Network bargaining with general capacities. Zbl 1395.91084
Farczadi, Linda; Georgiou, Konstantinos; Könemann, Jochen
2
2013
Better approximation algorithms for technology diffusion. Zbl 1395.68337
Könemann, Jochen; Sadeghian, Sina; Sanità, Laura
2
2013
Distributed weighted vertex cover via maximal matchings. Zbl 1128.68401
Grandoni, Fabrizio; Könemann, Jochen; Panconesi, Alessandro
2
2005
Covering graphs using trees and stars. Zbl 1279.68353
Even, G.; Garg, N.; Könemann, J.; Ravi, R.; Sinha, A.
2
2003
Max-weight integral multicommodity flow in spiders and high-capacity trees. Zbl 1192.90231
Könemann, Jochen; Parekh, Ojas; Pritchard, David
2
2009
Strict cost sharing schemes for Steiner forest. Zbl 1209.68275
Fleischer, Lisa; Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido
2
2010
On generalizations of network design problems with degree bounds. Zbl 1285.90044
Bansal, Nikhil; Khandekar, Rohit; Könemann, Jochen; Nagarajan, Viswanath; Peis, Britta
2
2010
Additive stabilizers for unstable graphs. Zbl 07065742
Chandrasekaran, Karthekeyan; Gottschalk, Corinna; Könemann, Jochen; Peis, Britta; Schmand, Daniel; Wierz, Andreas
2
2019
Travelling on graphs with small highway dimension. Zbl 07173299
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Könemann, Jochen
2
2019
A \((1+\varepsilon)\)-embedding of low highway dimension graphs into bounded treewidth graphs. Zbl 1398.68672
Feldmann, Andreas Emil; Fung, Wai Shing; Könemann, Jochen; Post, Ian
2
2018
An approximation algorithm for the edge-dilation \(k\)-center problem. Zbl 1052.05064
Könemann, Jochen; Li, Yanjun; Parekh, Ojas; Sinha, Amitabh
1
2004
Approximate deadline-scheduling with precedence constraints. Zbl 1467.68214
Efsandiari, Hossein; Hajiaghyi, MohammadTaghi; Könemann, Jochen; Mahini, Hamid; Malec, David; Sanità, Laura
1
2015
Stable marriage with general preferences. Extended abstract. Zbl 1403.91258
Farczadi, Linda; Georgiou, Konstantinos; Könemann, Jochen
1
2014
Hypergraphic LP relaxations for Steiner trees. Zbl 1283.90042
Chakrabarty, Deeparnab; Könemann, Jochen; Pritchard, David
1
2013
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Zbl 1360.90221
Feldmann, Andreas Emil; Könemann, Jochen; Olver, Neil; Sanità, Laura
1
2016
Efficient cost-sharing mechanisms for prize-collecting problems. Zbl 1319.90056
Gupta, A.; Könemann, Jochen; Leonardi, S.; Ravi, R.; Schäfer, G.
1
2015
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Zbl 1227.05203
Chakrabarty, Deeparnab; Könemann, Jochen; Pritchard, David
1
2010
Approximating the degree-bounded minimum diameter spanning tree problem. Zbl 1279.68357
Könemann, Jochen; Levin, Asaf; Sinha, Amitabh
1
2003
The school bus problem on trees. Zbl 1329.68283
Bock, Adrian; Grant, Elyot; Könemann, Jochen; Sanità, Laura
1
2011
Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner trees. Zbl 1205.68515
Könemann, Jochen; Ravi, R.
1
2003
Network bargaining: using approximate blocking sets to stabilize unstable instances. Zbl 1284.91183
Könemann, Jochen; Larson, Kate; Steiner, David
1
2012
Social exchange networks with distant bargaining. Zbl 1386.91074
Georgiou, Konstantinos; Karakostas, George; Könemann, Jochen; Stamirowska, Zuzanna
1
2014
A gentle introduction to optimization. Zbl 1322.90001
Guenin, Bertrand; Könemann, J.; Tunçel, L.
1
2014
An elementary integrality proof of Rothblum’s stable matching formulation. Zbl 1408.90257
Könemann, Jochen; Pashkovich, Kanstantsin; Toth, Justin
1
2016
Computing the nucleolus of weighted cooperative matching games in polynomial time. Zbl 1436.91008
Könemann, Jochen; Pashkovich, Kanstantsin; Toth, Justin
1
2019
Distributed weighted vertex cover via maximal matchings. Zbl 1445.68164
Grandoni, Fabrizio; Könemann, Jochen; Panconesi, Alessandro
1
2008
Additive stabilizers for unstable graphs. Zbl 07065742
Chandrasekaran, Karthekeyan; Gottschalk, Corinna; Könemann, Jochen; Peis, Britta; Schmand, Daniel; Wierz, Andreas
2
2019
Travelling on graphs with small highway dimension. Zbl 07173299
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Könemann, Jochen
2
2019
Computing the nucleolus of weighted cooperative matching games in polynomial time. Zbl 1436.91008
Könemann, Jochen; Pashkovich, Kanstantsin; Toth, Justin
1
2019
Approximating weighted tree augmentation via Chvátal-Gomory cuts. Zbl 1403.68347
Fiorini, Samuel; Groß, Martin; Könemann, Jochen; Sanità, Laura
7
2018
A \((1+\varepsilon)\)-embedding of low highway dimension graphs into bounded treewidth graphs. Zbl 1398.68672
Feldmann, Andreas Emil; Fung, Wai Shing; Könemann, Jochen; Post, Ian
2
2018
Stable marriage with general preferences. Zbl 1356.91072
Farczadi, Linda; Georgiou, Konstantinos; Könemann, Jochen
4
2016
Lehman’s theorem and the directed Steiner tree problem. Zbl 1336.90107
Abdi, Ahmad; Feldmann, Andreas Emil; Guenin, Bertrand; Könemann, Jochen; Sanità, Laura
3
2016
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Zbl 1360.90221
Feldmann, Andreas Emil; Könemann, Jochen; Olver, Neil; Sanità, Laura
1
2016
An elementary integrality proof of Rothblum’s stable matching formulation. Zbl 1408.90257
Könemann, Jochen; Pashkovich, Kanstantsin; Toth, Justin
1
2016
Finding small stabilizers for unstable graphs. Zbl 1337.05085
Bock, Adrian; Chandrasekaran, Karthekeyan; Könemann, Jochen; Peis, Britta; Sanità, Laura
10
2015
Network bargaining: using approximate blocking sets to stabilize unstable instances. Zbl 1327.91019
Könemann, Jochen; Larson, Kate; Steiner, David
6
2015
A \((1+{\varepsilon})\) -embedding of low highway dimension graphs into bounded treewidth graphs. Zbl 1398.68671
Feldmann, Andreas Emil; Fung, Wai Shing; Könemann, Jochen; Post, Ian
4
2015
Approximate deadline-scheduling with precedence constraints. Zbl 1467.68214
Efsandiari, Hossein; Hajiaghyi, MohammadTaghi; Könemann, Jochen; Mahini, Hamid; Malec, David; Sanità, Laura
1
2015
Efficient cost-sharing mechanisms for prize-collecting problems. Zbl 1319.90056
Gupta, A.; Könemann, Jochen; Leonardi, S.; Ravi, R.; Schäfer, G.
1
2015
Linear programming hierarchies suffice for directed Steiner tree. Zbl 1418.90223
Friggstad, Zachary; Könemann, Jochen; Kun-Ko, Young; Louis, Anand; Shadravan, Mohammad; Tulsiani, Madhur
5
2014
Finding small stabilizers for unstable graphs. Zbl 1410.91017
Bock, Adrian; Chandrasekaran, Karthekeyan; Könemann, Jochen; Peis, Britta; Sanità, Laura
2
2014
Stable marriage with general preferences. Extended abstract. Zbl 1403.91258
Farczadi, Linda; Georgiou, Konstantinos; Könemann, Jochen
1
2014
Social exchange networks with distant bargaining. Zbl 1386.91074
Georgiou, Konstantinos; Karakostas, George; Könemann, Jochen; Stamirowska, Zuzanna
1
2014
A gentle introduction to optimization. Zbl 1322.90001
Guenin, Bertrand; Könemann, J.; Tunçel, L.
1
2014
On generalizations of network design problems with degree bounds. Zbl 1295.90059
Bansal, Nikhil; Khandekar, Rohit; Könemann, Jochen; Nagarajan, Viswanath; Peis, Britta
11
2013
Network bargaining with general capacities. Zbl 1395.91084
Farczadi, Linda; Georgiou, Konstantinos; Könemann, Jochen
2
2013
Better approximation algorithms for technology diffusion. Zbl 1395.68337
Könemann, Jochen; Sadeghian, Sina; Sanità, Laura
2
2013
Hypergraphic LP relaxations for Steiner trees. Zbl 1283.90042
Chakrabarty, Deeparnab; Könemann, Jochen; Pritchard, David
1
2013
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. Zbl 1421.68198
Chan, Timothy M.; Grant, Elyot; Könemann, Jochen; Sharpe, Malcolm
18
2012
Network bargaining: using approximate blocking sets to stabilize unstable instances. Zbl 1284.91183
Könemann, Jochen; Larson, Kate; Steiner, David
1
2012
A unified approach to approximating partial covering problems. Zbl 1211.68511
Könemann, Jochen; Parekh, Ojas; Segev, Danny
17
2011
A partition-based relaxation for Steiner trees. Zbl 1222.68413
Könemann, Jochen; Pritchard, David; Tan, Kunlun
3
2011
The school bus problem on trees. Zbl 1329.68283
Bock, Adrian; Grant, Elyot; Könemann, Jochen; Sanità, Laura
1
2011
On column-restricted and priority covering integer programs. Zbl 1285.90014
Chakrabarty, Deeparnab; Grant, Elyot; Könemann, Jochen
18
2010
Hypergraphic LP relaxations for Steiner trees. Zbl 1285.90046
Chakrabarty, Deeparnab; Könemann, Jochen; Pritchard, David
3
2010
Strict cost sharing schemes for Steiner forest. Zbl 1209.68275
Fleischer, Lisa; Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido
2
2010
On generalizations of network design problems with degree bounds. Zbl 1285.90044
Bansal, Nikhil; Khandekar, Rohit; Könemann, Jochen; Nagarajan, Viswanath; Peis, Britta
2
2010
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Zbl 1227.05203
Chakrabarty, Deeparnab; Könemann, Jochen; Pritchard, David
1
2010
Max-weight integral multicommodity flow in spiders and high-capacity trees. Zbl 1192.90231
Könemann, Jochen; Parekh, Ojas; Pritchard, David
2
2009
A group-strategyproof cost sharing mechanism for the Steiner forest game. Zbl 1225.68272
Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido; van Zwam, Stefan H. M.
14
2008
On the integrality ratio for tree augmentation. Zbl 1155.90466
Cheriyan, J.; Karloff, H.; Khandekar, R.; Könemann, J.
12
2008
A primal-dual bicriteria distributed algorithm for capacitated vertex cover. Zbl 1187.68707
Grandoni, F.; Könemann, J.; Panconesi, A.; Sozio, M.
9
2008
Distributed weighted vertex cover via maximal matchings. Zbl 1445.68164
Grandoni, Fabrizio; Könemann, Jochen; Panconesi, Alessandro
1
2008
Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Zbl 1137.90014
Garg, Naveen; Könemann, Jochen
32
2007
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. Zbl 1302.90235
Gupta, A.; Könemann, J.; Leonardi, S.; Ravi, R.; Schäfer, G.
8
2007
Cut problems in graphs with a budget constraint. Zbl 1135.90419
Engelberg, Roee; Könemann, Jochen; Leonardi, Stefano; Naor, Joseph (Seffi)
7
2007
A unified approach to approximating partial covering problems. Zbl 1131.90443
Könemann, Jochen; Parekh, Ojas; Segev, Danny
6
2006
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. Zbl 1301.68271
Fleischer, Lisa; Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido
6
2006
Cut problems in graphs with a budget constraint. Zbl 1145.05321
Engelberg, Roee; Könemann, Jochen; Leonardi, Stefano; Naor, Joseph (Seffi)
5
2006
Approximating \(k\)-hop minimum-spanning trees. Zbl 1099.90064
Althaus, Ernst; Funke, Stefan; Har-Peled, Sariel; Könemann, Jochen; Ramos, Edgar A.; Skutella, Martin
12
2005
Primal-dual meets local search: approximating MSTs with nonuniform degree bounds. Zbl 1075.68101
Könemann, J.; Ravi, R.
11
2005
A group-strategyproof mechanism for Steiner forests. Zbl 1297.91017
Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido
9
2005
Approximating the degree-bounded minimum diameter spanning tree problem. Zbl 1082.68085
Könemann, Jochen; Levin, Asaf; Sinha, Amitabh
6
2005
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. Zbl 1314.68156
Grandoni, F.; Könemann, J.; Panconesi, A.; Sozio, M.
4
2005
From primal-dual to cost shares and back: A stronger LP relaxation for the Steiner forest problem. Zbl 1084.90525
Könemann, Jochen; Leonardi, Stefano; Schäfer, Guido; van Zwam, Stefan
3
2005
Sharing the cost more efficiently, improved approximation for multicommodity rent-or-buy. Zbl 1297.90010
Becchetti, Luca; Könemann, Jochen; Leonardi, Stefano; Pál, M.
3
2005
Distributed weighted vertex cover via maximal matchings. Zbl 1128.68401
Grandoni, Fabrizio; Könemann, Jochen; Panconesi, Alessandro
2
2005
Min-max tree covers of graphs. Zbl 1054.90079
Even, G.; Garg, N.; Könemann, J.; Ravi, R.; Sinha, A.
25
2004
Improved approximations for tour and tree covers. Zbl 1138.68666
Könemann, Jochen; Konjevod, Goran; Parekh, Ojas; Sinha, Amitabh
7
2004
Non-clairvoyant scheduling for minimizing mean slowdown. Zbl 1082.68010
Bansal, Nikhil; Dhamdhere, Kedar; Könemann, Jochen; Sinha, Amitabh
3
2004
An approximation algorithm for the edge-dilation \(k\)-center problem. Zbl 1052.05064
Könemann, Jochen; Li, Yanjun; Parekh, Ojas; Sinha, Amitabh
1
2004
Primal-dual meets local search: approximating MST’s with nonuniform degree bounds. Zbl 1192.90232
Könemann, Jochen; Ravi, R.
8
2003
A combinatorial algorithm for computing a maximum independent set in a \(t\)-perfect graph. Zbl 1092.68623
Eisenbrand, Friedrich; Funke, Stefan; Garg, Naveen; Könemann, Jochen
4
2003
Non-clairvoyant scheduling for minimizing mean slowdown. Zbl 1035.68504
Bansal, N.; Dhamdhere, K.; Könemann, J.; Sinha, A.
3
2003
Covering graphs using trees and stars. Zbl 1279.68353
Even, G.; Garg, N.; Könemann, J.; Ravi, R.; Sinha, A.
2
2003
Approximating the degree-bounded minimum diameter spanning tree problem. Zbl 1279.68357
Könemann, Jochen; Levin, Asaf; Sinha, Amitabh
1
2003
Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner trees. Zbl 1205.68515
Könemann, Jochen; Ravi, R.
1
2003
A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. Zbl 1008.68162
Könemann, J.; Ravi, R.
21
2002
Approximation algorithms for edge-dilation \(k\)-center problems. Zbl 1078.68828
Könemann, Jochen; Li, Yanjun; Parekh, Ojas; Sinha, Amitabh
2
2002
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. Zbl 1296.68195
Könemann, J.; Ravi, R.
5
2000
Improved approximations for tour and tree covers. Zbl 0976.05063
Könemann, Jochen; Konjevod, Goran; Parekh, Ojas; Sinha, Amitabh
4
2000
all top 5

Cited by 584 Authors

18 Könemann, Jochen
12 Nagarajan, Viswanath
8 Nutov, Zeev
8 Sanità, Laura
7 Swamy, Chaitanya
6 Zenklusen, Rico
6 Zhang, Zhao
5 Bansal, Nikhil
5 Chandrasekaran, Karthekeyan
5 Feldmann, Andreas Emil
5 Fujito, Toshihiro
5 Fukunaga, Takuro
5 Grandoni, Fabrizio
5 Nagamochi, Hiroshi
5 Parekh, Ojas D.
5 Pashkovich, Kanstantsin
5 Ran, Yingli
4 Chakrabarty, Deeparnab
4 Georgiou, Konstantinos
4 Gupta, Anupam
4 Harks, Tobias
4 Kao, Mong-Jen
4 Liu, Zhaohui
4 Mustafa, Nabil Hassan
4 Olver, Neil
4 Ravi, Ramamoorthi
4 Schafer, Guido
4 Schmidt, Daniel R.
4 Segev, Danny
4 Singh, Mohit
4 Vygen, Jens
4 Xu, Zhou
4 Yu, Wei
3 Abdi, Ahmad
3 Anshelevich, Elliot
3 Caskurlu, Bugra
3 Cheriyan, Joseph
3 Doi, Takashi
3 Du, Ding-Zhu
3 Holzhauser, Michael
3 Kamiyama, Naoyuki
3 Khani, Mohammad Reza
3 Klein, Philip N.
3 Krumke, Sven Oliver
3 Lee, Der-Tsai
3 Levin, Asaf
3 Linhares, André
3 Molinaro, Marco
3 Nguyen, Viet Hung
3 Peis, Britta
3 Raman, Rajiv
3 Ray, Saurabh
3 Salavatipour, Mohammad R.
3 Talwar, Kunal
3 Ventresca, Mario
3 Young, Neal E.
2 Ahmadian, Sara
2 Aleman, Dionne M.
2 Armon, Amitai
2 Bao, Xiaoguang
2 Bergantiños, Gustavo
2 Berger, André
2 Bruhn, Henning
2 Campbell, Ann Melissa
2 Chan, Timothy Moon-Yew
2 Chaudhuri, Kamalika
2 Chen, Hui
2 Chwa, Kyungyong
2 Cohen, Nachshon
2 Cornuéjols, Gérard P.
2 De, Minati
2 Epstein, Leah
2 Fiorini, Samuel
2 Galtier, Jérôme
2 Gao, Zhihan
2 Gómez-Rúa, María
2 Gørtz, Inge Li
2 Grant, Elyot
2 Hate, Ameya
2 Hoefer, Martin
2 Hosseinzadeh, Hamideh
2 Huang, Chien-Chung
2 Huang, Xiaohui
2 Im, Sungjin
2 Kakimura, Naonori
2 Kern, Walter
2 Khandekar, Rohit
2 Kim, Donghyun
2 Klimm, Max
2 Kolman, Petr
2 Koufogiannakis, Christos
2 Krishnaswamy, Ravishankar
2 Kuhn, Fabian
2 Kulik, Ariel
2 Kumar, Amit
2 Kupavskii, Andrey
2 Kurpisz, Adam
2 Le Bodic, Pierre
2 Lee, Dabeen
2 Lee, Jon
...and 484 more Authors
all top 5

Cited in 61 Serials

30 Theoretical Computer Science
23 Mathematical Programming. Series A. Series B
19 Algorithmica
17 Journal of Combinatorial Optimization
13 Discrete Applied Mathematics
12 Information Processing Letters
12 Theory of Computing Systems
10 Mathematics of Operations Research
10 Operations Research Letters
9 Discrete Optimization
8 SIAM Journal on Computing
8 SIAM Journal on Discrete Mathematics
6 Journal of Computer and System Sciences
5 Games and Economic Behavior
5 European Journal of Operational Research
5 Distributed Computing
4 Computational Geometry
4 Journal of Discrete Algorithms
3 Networks
3 Discrete & Computational Geometry
3 Computers & Operations Research
2 Applied Mathematics and Computation
2 Naval Research Logistics
2 Operations Research
2 Journal of Parallel and Distributed Computing
2 Annals of Operations Research
2 Journal of Global Optimization
2 Annals of Mathematics and Artificial Intelligence
2 Journal of Scheduling
2 RAIRO. Operations Research
2 Discrete Mathematics, Algorithms and Applications
2 Journal of the Operations Research Society of China
1 Artificial Intelligence
1 Discrete Mathematics
1 Automatica
1 International Journal of Game Theory
1 SIAM Journal on Control and Optimization
1 Systems & Control Letters
1 Combinatorica
1 Social Choice and Welfare
1 Journal of Symbolic Computation
1 Information and Computation
1 Asia-Pacific Journal of Operational Research
1 Queueing Systems
1 Real-Time Systems
1 International Journal of Computational Geometry & Applications
1 Automation and Remote Control
1 Bulletin of the American Mathematical Society. New Series
1 Computational Optimization and Applications
1 Mathematical Methods of Operations Research
1 Journal of Graph Algorithms and Applications
1 Journal of the ACM
1 CEJOR. Central European Journal of Operations Research
1 Journal of Machine Learning Research (JMLR)
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 ANACM. Applied Numerical Analysis and Computational Mathematics
1 Optimization Letters
1 The Annals of Applied Statistics
1 Algorithms
1 Mathematical Programming Computation
1 Numerical Algebra, Control and Optimization

Citations by Year