Graph Properties that Facilitate Travelling

Fotakis, D; Spirakis, P

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Spirakis, P	en
dc.date.accessioned	2014-03-01T01:46:43Z
dc.date.available	2014-03-01T01:46:43Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25024
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc5.html#ECCC-TR98-031	en
dc.subject	Maximum Independent Set	en
dc.subject	Parallel Algorithm	en
dc.subject	Travelling Salesman Problem	en
dc.title	Graph Properties that Facilitate Travelling	en
heal.type	journalArticle	en
heal.publicationDate	1998	en
heal.abstract	. In this work, we study two special cases of the metric Travelling Salesman Problem,Graph TSP and TSP(1,2). At first, we show that dense instances of TSP(1,2) and Graph TSPare essentially as hard to approximate as general instances of TSP(1,2).Next, we present an NC algorithm for TSP(1,2) that produces a tour of length at most n plusthe cardinality of the	en
heal.journalName	Electronic Colloquium on Computational Complexity	en