An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364): Difference between revisions

@@ label / en / label / en @@
+An Improved Online Algorithm for the Traveling Repairperson Problem on a Line
@@ Property / DOI @@
-.4230/LIPIcs.MFCS.2019.6
@@ Property / DOI: 10.4230/LIPIcs.MFCS.2019.6 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the travelling repairman problem
+Normal rank
@@ Property / cites work @@
+Q5417636
@@ Property / cites work: Q5417636 / rank @@
+Normal rank
@@ Property / cites work @@
+A hard dial-a-ride problem that is easy on average
+Normal rank
@@ Property / cites work @@
+Serving requests with on-line routing
@@ Property / cites work: Serving requests with on-line routing / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive algorithms for the on-line traveling salesman
+Normal rank
@@ Property / cites work @@
+Algorithms for the on-line travelling salesman
@@ Property / cites work: Algorithms for the on-line travelling salesman / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in the plane
@@ Property / cites work: Searching in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Online TSP on the Line
@@ Property / cites work: Tight Bounds for Online TSP on the Line / rank @@
+Normal rank
@@ Property / cites work @@
+Online \(k\)-server routing problems
@@ Property / cites work: Online \(k\)-server routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line single-server dial-a-ride problems
@@ Property / cites work: On-line single-server dial-a-ride problems / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bounds for online \(k\)-server routing problems
+Normal rank
@@ Property / cites work @@
+An improved approximation ratio for the minimum latency problem
+Normal rank
@@ Property / cites work @@
+Q2728895
@@ Property / cites work: Q2728895 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+News from the online traveling repairman.
@@ Property / cites work: News from the online traveling repairman. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411288
@@ Property / cites work: Q4411288 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737530
@@ Property / cites work: Q4737530 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
+Normal rank
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2019/10950/pdf/LIPIcs-MFCS-2019-6.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W2970958781
@@ Property / OpenAlex ID: W2970958781 / rank @@
+Normal rank
@@ Property / title @@
+An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.MFCS.2019.6
@@ Property / DOI: 10.4230/LIPICS.MFCS.2019.6 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5092364