|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
33 | Vera Traub, Jens Vygen, Rico Zenklusen |
Reducing Path TSP to TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 51(3), pp. 20-24, June 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
33 | Vera Traub, Jens Vygen, Rico Zenklusen |
Reducing path TSP to TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pp. 14-27, 2020, ACM, 978-1-4503-6979-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
33 | Vera Traub, Jens Vygen, Rico Zenklusen |
Reducing Path TSP to TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.10376, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
26 | Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff |
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 427-436, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
prize-collecting, stroll, path-TSP, approximation algorithm, traveling salesman problem, Steiner tree |
19 | Kristóf Bérczi, Matthias Mnich, Roland Vincze |
A 3/2-Approximation for the Metric Many-Visits Path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 36(4), pp. 2995-3030, December 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Xianghui Zhong |
Slightly improved upper bound on the integrality ratio for the s-t Path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 48(5), pp. 627-629, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Xianghui Zhong |
A Small Improvement to the Upper Bound on the Integrality Ratio for the s-t Path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.07217, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
19 | Kristóf Bérczi, Matthias Mnich, Roland Vincze |
A 3/2-Approximation for the Metric Many-visits Path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.11389, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
19 | Vera Traub, Jens Vygen |
An improved upper bound on the integrality ratio for the s-t-path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 47(3), pp. 225-228, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Vera Traub, Jens Vygen |
Approaching 3/2 for the s-t-path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 66(2), pp. 14:1-14:17, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Rico Zenklusen |
A 1.5-Approximation for Path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 1539-1549, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Rico Zenklusen |
A 1.5-Approximation for Path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.04131, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
19 | Vera Traub, Jens Vygen |
An improved upper bound on the integrality ratio for the s-t-path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.10734, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
19 | Vera Traub, Jens Vygen |
Approaching for the s-t-path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 1854-1864, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Vera Traub, Jens Vygen |
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.03992, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
19 | Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys |
Improving Christofides' Algorithm for the s-t Path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 62(5), pp. 34:1-34:28, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Zhihan Gao 0002 |
Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2015 |
RDF |
|
19 | Zhihan Gao 0002 |
An LP-based 3/2-approximation algorithm for the graphic s-t path TSP ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.7055, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
19 | András Sebö |
Eight-Fifth Approximation for the Path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings, pp. 362-374, 2013, Springer, 978-3-642-36693-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Hyung-Chan An, Robert Kleinberg, David B. Shmoys |
Improving christofides' algorithm for the s-t path TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, pp. 875-886, 2012, ACM, 978-1-4503-1245-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Hyung-Chan An, Robert Kleinberg, David B. Shmoys |
Improving Christofides' Algorithm for the s-t Path TSP ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1110.4604, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|