Complexity of routing problems in the Manhattan model

Szkaliczki, Tibor (1999) Complexity of routing problems in the Manhattan model. In: The proceedings of the 1st Japanese-Hungarian symposium on discrete mathematics and its applications. Kyoto, 1999..

Full text not available from this repository.
Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: ELearning Department
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 14:58
Last Modified: 11 Dec 2012 14:58
URI: http://eprints.sztaki.hu/id/eprint/2193

Update Item Update Item