The travelling miser problem

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2002, Pages 312-321

  Breitgand, David ^a   Raz, Danny ^b   Shavitt, Yuval ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; HTTP; INTERFERENCE SUPPRESSION; PACKET SWITCHING; TOPOLOGY; TRAVELING SALESMAN PROBLEM;

ONLINE VARIANT PROBLEM; TRAVELING MISER PROBLEM;

CONGESTION CONTROL (COMMUNICATION);

EID: 0036346541     PISSN: 0743166X     EISSN: None     Source Type: Journal    
DOI: 10.1109/INFCOM.2002.1019273     Document Type: Article

References (16)

1. Active networks for efficient distributed network management
2. Minimum weight paths in time-dependent networks
3. On a routing problem
4. Determination of shortest path in a network with time-dependent edge-lengths
5. The shortest route through a network with time-dependent intermodal transit times
6. Shortest route with time dependent length of edges and limited delay possibilities in nodes
7. Distributed shortest path and minimum-delay protocols in networks with time-dependent edge-length
8. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
9. Shortest paths in a network with time-dependent flow speeds
10. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
11. The canadian traveller problem
12. Shortest paths without a map
13. Active networks: Applications, security, safety, and architectures
14. Active distributed management for IP networks
15. Smart packets for active networks