Approximation algorithms for some routing problems

Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained route to that of an optimal are determined. A mixed-strategy heuristic with a bound of 9/5 is presented for the Stacker-Crane problem (a modifie...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annual Symposium on Foundations of Computer Science S. 216 - 227
Hauptverfasser:	Frederickson, Greg N., Hecht, Matthew S., Kim, Chul E.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.10.1976
Schlagworte:	Approximation algorithms Cities and towns Computer science Cost function Cranes Educational institutions Minimax techniques Polynomials Routing Traveling salesman problems
ISSN:	0272-5428
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!