Author of the publication

Competitive Algorithms for the On-line Traveling Salesman.

, , , , and . WADS, volume 955 of Lecture Notes in Computer Science, page 206-217. Springer, (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Completeness in differential approximation classes., , , and . Int. J. Found. Comput. Sci., 16 (6): 1267-1295 (2005)Incremental Algorithms for Minimal Length Paths., , , and . SODA, page 12-21. SIAM, (1990)Graph Algorithms for Functional Dependency Manipulation, , and . J. ACM, 30 (4): 752-766 (October 1983)Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms., , and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 1-16. Springer, (1998)On-Line Algorithms for Polynomially Solvable Satisfiability Problems., and . J. Log. Program., 10 (1): 69-90 (1991)Dynamic Maintenance of Paths and Path Expressions on Graphs., , and . ISSAC, volume 358 of Lecture Notes in Computer Science, page 1-12. Springer, (1988)Design of algebraic data structures with the approach of abstract data types., and . EUROSAM, volume 72 of Lecture Notes in Computer Science, page 514-530. Springer, (1979)Lattice theoretic ordering properties for NP-complete optimization problems., , and . Fundam. Informaticae, 4 (1): 83-94 (1981)Abstract Computational Complexity and Cycling Computations.. J. Comput. Syst. Sci., 5 (2): 118-128 (1971)The on-line asymmetric traveling salesman problem., , and . J. Discrete Algorithms, 6 (2): 290-298 (2008)