Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The Traveling Salesman Problem for lines in the plane
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
2002 (English)In: Information Processing Letters, ISSN 0020-0190, E-ISSN 1872-6119, Vol. 82, no 3, p. 137-142Article in journal (Refereed) Published
Abstract [en]

We present an algorithm that computes the shortest route that intersects n lines in the plane in time polynomial in n; the time complexity is dominated by the time it takes to compute a shortest watchman route in a simple polygon of size n. We also present a simple O(n) time algorithm for computing a route that intersects the lines but which is guaranteed to have a length at most √2 times longer than the shortest route.

Place, publisher, year, edition, pages
2002. Vol. 82, no 3, p. 137-142
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-9785DOI: 10.1016/S0020-0190(01)00259-9ISI: 000177050100004Scopus ID: 2-s2.0-0037118194Local ID: 877371d0-a0e0-11db-8975-000ea68e967bOAI: oai:DiVA.org:ltu-9785DiVA, id: diva2:982723
Note
Validerad; 2002; 20070110 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Jonsson, Håkan

Search in DiVA

By author/editor
Jonsson, Håkan
By organisation
Computer Science
In the same journal
Information Processing Letters
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf