Szkaliczki, Tibor (1999) Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete. SIAM JOURNAL ON COMPUTING, 29 (1). pp. 274-287.

Full text not available from this repository.

Item Type:	Article
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User:	Eszter Nagy
Date Deposited:	11 Dec 2012 14:58
Last Modified:	09 Oct 2013 07:38
URI:	https://eprints.sztaki.hu/id/eprint/2213

Update Item