×

Found 410 Documents (Results 1–100)

Newest Citations Relevance
Pérez-Escalona, Pedro; Rapaport, Ivan; Soto, José; Vidal, Ian

The multiple traveling salesman problem on spiders. (English) Zbl 1490.90253

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 337-348 (2021).
MSC:  90C27 68Q17 68W25 90C59
Cite Review PDF
Full Text: DOI
Kisfaludi-Bak, Sándor

A quasi-polynomial algorithm for well-spaced hyperbolic TSP. (English) Zbl 1533.68373

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 55, 15 p. (2020).
MSC:  68U05 51M09 68W40 90C27
Cite Review PDF
Full Text: DOI
Frieze, Alan; Pegden, Wesley

Traveling in randomly embedded random graphs. (English) Zbl 1467.05243

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 45, 17 p. (2017).
MSC:  05C80 05C38 05C12 05C35 90C35
Cite Review PDF
Full Text: DOI
Arkin, Esther M.; Banik, Aritra; Carmi, Paz; Citovsky, Gui; Jia, Su; Katz, Matthew J.; Mayer, Tyler; Mitchell, Joseph S. B.

Network optimization on partitioned pairs of points. (English) Zbl 1457.68199

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 6, 12 p. (2017).
MSC:  68R10 68Q17 68W25 90C27 90C35
Cite Review PDF
Full Text: DOI arXiv
An, Hyung-Chan; Kleinberg, Robert; Shmoys, David B.

Improving Christofides’ algorithm for the \(s\)-\(t\) path TSP. (English) Zbl 1286.68173

Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 875-886 (2012).
MSC:  68Q17 05C38 68W25 90C27 90C59
Cite Review PDF
Full Text: DOI
Bartal, Yair; Gottlieb, Lee-Ad; Krauthgamer, Robert

The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. (English) Zbl 1286.68177

Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 663-672 (2012).
MSC:  68Q17 68W20 68W25 90C27 90C59
Cite Review PDF
Full Text: DOI
Cheriyan, Joseph; Friggstad, Zachary; Gao, Zhihan

Approximating minimum-cost connected \(T\)-joins. (English) Zbl 1322.68263

Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 110-121 (2012).
MSC:  68W25 90C27
Cite Review PDF
Full Text: DOI
Chandra, Anjan Kumar; Chakrabarti, Bikas. K.

Optimization and quantum annealing. (English) Zbl 1260.82002

Santra, Sitangshu Bikas (ed.) et al., Computational statistical physics. Lecture notes, Guwahati SERC school, India, December 1–21, 2008. Invited lectures. New Delhi: Hindustan Book Agency (ISBN 978-93-80250-15-1/pbk). Texts and Readings in the Physical Sciences 10, 251-277 (2011).
MSC:  82-08 82D30 82B20 82B80 90C27 90C59 90C60
Cite Review PDF
Glaßer, Christian; Reitwießner, Christian; Witek, Maximilian

Applications of discrepancy theory in multiobjective approximation. (English) Zbl 1246.68264

Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 55-65, electronic only (2011).
MSC:  68W25 90C29 68W20 90C60 90C35
Cite Review PDF
Full Text: DOI arXiv
Medeiros, André César; Urrutia, Sebastián

Discrete optimization methods to determine trajectories for Dubins’ vehicles. (English) Zbl 1237.90004

Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 17-24 (2010).
MSC:  90-04 90C27
Cite Review PDF
Full Text: DOI
Van Nijnatten, Fred; Sitters, René; Woeginger, Gerhard J.; Wolff, Alexander; De Berg, Mark

The traveling salesman problem under squared Euclidean distances. (English) Zbl 1230.68217

Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 239-250, electronic only (2010).
MSC:  68W25 68Q17 68M20 68R10 68U05
Cite Review PDF
Full Text: DOI Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software