Searching for "Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294]." – sorted by Relevance.
-
News from the Online Traveling Repairman
- News from the Online Traveling Repairman Sven O. Krumke ?1 , Willem E. de Paepe 2 , Diana
- Cited by 14 (3 self) – Add To MetaCart
-
The k-Traveling Repairman Problem
- -MST problem. 1. There exists an 8# ln n polynomial-time approximation algorithm for the k-traveling repairman
- Cited by 18 (1 self) – Add To MetaCart
-
Special cases of traveling salesman and repairman problems with time windows
- Special Cases of Traveling Salesman and Repairman Problems with Time Windows* John N. Tsitsiklis
- Cited by 22 (0 self) – Add To MetaCart
-
Erratum
- . Letting r � 7 results in a chord given by mod12(r�0, r�4, r�7) � {7,11,2}. From Table 1, it is easy
- Add To MetaCart
-
Erratum To
- A) = 1 8A(1 + aeA) : (2) ERRATUM TO iDYNAMICAL SOURCES IN INFORMATION THEORY ... 3 Suppose
- Add To MetaCart
-
Erratum to
- Erratum to Measurement of Open Beauty Production at HERA, Phys. Lett. B467 (1999) 156. H1
- Add To MetaCart
-
erratum
- Theoretical Computer Science 254 (2001) 691–694 www.elsevier.com/locate/tcs Erratum Corrigendum
- Cited by 1 (0 self) – Add To MetaCart
-
ERRATUM
- Temporal and Spatial Locality Number of Memory Slots 1 2 4 5 3 6 7 8 9 10 11 12 13 14 15 Reserved Nodes
- Add To MetaCart
-
On the Power of Lookahead in On-line Server Routing Problems
- in this setting, such as the online traveling salesman and the online traveling repairman problem. We show
- Add To MetaCart
-
The on-line asymmetric traveling salesman problem
- The On-line Asymmetric Traveling Salesman Problem ⋆ Giorgio Ausiello 1 , Vincenzo Bonifaci 1
- Cited by 6 (4 self) – Add To MetaCart

