The SCEAS System
Navigation Menu

Journals in DBLP

2000, volume: 34, number: 3

  1. D. Arun Kumar, C. Pandu Rangan
    Approximation algorithms for the Traveling Salesman Problem with range condition. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:3, pp:173-182 [Journal]
  2. David Simplot, Alain Terlutte
    Closure under union and composition of iterated rational transductions. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:3, pp:183-212 [Journal]
  3. Hans-Joachim Böckenhauer, Sebastian Seibert
    Improved lower bounds on the approximability of the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:3, pp:213-255 [Journal]
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002