Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

The backbone of the travelling salesperson

Date

Authors

Kilby, Philip

Slaney, John K

Walsh, Toby

Publisher

AAAI Press

Abstract

We study the backbone of the travelling salesperson optimization problem. We prove that it is intractable to approximate the backbone with any performance guarantee, assuming that P≠NP and there is a limit on the number of edges falsely returned. Nevert

Keywords

Keywords: Approximation methods; Optimal solutions; Optimality; Optimization problems; Performance guarantees; Runtimes; Artificial intelligence; Optimization; Optimal systems

URI

http://hdl.handle.net/1885/49661

Collections

ANU Research Publications

Source

Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)

Type

Conference paper

Restricted until

2037-12-31

Downloads

File

Description

01_Kilby_The_backbone_of_the_travelling_2005.pdf (1 MB)

02_Kilby_The_backbone_of_the_travelling_2005.pdf (238.8 KB)

03_Kilby_The_backbone_of_the_travelling_2005.pdf (1.37 MB)

abcd