Makespan Trade-Offs for Visiting Triangle Edges

Konstantinos Georgiou, Somnath Kundu, Paweł Prałat

Type: Book-Chapter

Publication Date: 2021-01-01

Citations: 4

DOI: https://doi.org/10.1007/978-3-030-79987-8_24

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Lower Bounds for Non-adaptive Shortest Path Relaxation	2023	David Eppstein
+ PDF Chat	The triangle scheduling problem	2017	Christoph Dürr Zdeněk Hanzálek Christian Konrad Yasmina Seddik René Sitters Óscar C. Vásquez Gerhard J. Woeginger
+ PDF Chat	Approximations for the Steiner Multicycle Problem	2022	Cristina G. Fernandes Carla Négri Lintzmayer Phablo F. S. Moura
+ PDF Chat	Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees	2018	Bahareh Banyassady Luis Barba Wolfgang Mulzer
+ PDF Chat	The Complexity of Rerouting Shortest Paths	2012	Paul Bonsma
+	The complexity of rerouting shortest paths	2013	Paul Bonsma
+ PDF Chat	A Flexible Approach for Finding Optimal Paths with Minimal Conflicts	2017	Juliana Bowles Marco B. Caminati
+ PDF Chat	Online Makespan Minimization with Parallel Schedules	2016	Susanne Albers Matthias Hellwig
+ PDF Chat	Online Makespan Minimization with Parallel Schedules	2014	Susanne Albers Matthias Hellwig
+ PDF Chat	Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling	2019	Víctor Verdugo José Verschae
+ PDF Chat	On packing time-respecting arborescences	2022	Romain Chapoullié Zoltán Szigeti
+	On the spanning tree polyhedron	1989	Sunil Chopra
+ PDF Chat	Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem	2015	Erez Kantor Shay Kutten
+ PDF Chat	Balancing minimum spanning trees and shortest-path trees	1995	Samir Khuller Balaji Raghavachari Neal E. Young
+	On the vertex packing problem	1993	Caterina De Simone
+	Minimum cost partitions of a rectangle	1981	Michelle L. Wachs
+ PDF Chat	Algorithms for Covering Multiple Barriers	2017	Shimin Li Haitao Wang
+ PDF Chat	Algorithms for covering multiple barriers	2018	Shimin Li Haitao Wang
+ PDF Chat	Breaking symmetries to rescue sum of squares in the case of makespan scheduling	2020	Víctor Verdugo José Verschae Andreas Wiese
+ PDF Chat	Time-Space Trade-offs for Triangulations and Voronoi Diagrams	2015	Matias Korman Wolfgang Mulzer André van Renssen Marcel Roeloffzen Paul Seiferth Yannik Stein

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Makespan Trade-Offs for Visiting Triangle Edges	2021	Konstantinos Georgiou Somnath Kundu Paweł Prałat

Works Cited by This (4)

Action	Title	Year	Authors
+ PDF Chat	The Traveling Salesman Problem for Lines, Balls, and Planes	2016	Adrian Dumitrescu Csaba D. Tóth
+	Lower Bounds for Shoreline Searching with 2 or More Robots	2020	Sumi Acharjee Konstantinos Georgiou Somnath Kundu Akshaya Srinivasan
+ PDF Chat	A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing	2014	Aparna Das Claire Mathieu
+ PDF Chat	Makespan Trade-Offs for Visiting Triangle Edges	2021	Konstantinos Georgiou Somnath Kundu Paweł Prałat