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...

Full description

Bibliographic Details

Published in:	Annual Symposium on Foundations of Computer Science pp. 216 - 227
Main Authors:	Frederickson, Greg N., Hecht, Matthew S., Kim, Chul E.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.1976
Subjects:	Approximation algorithms Cities and towns Computer science Cost function Cranes Educational institutions Minimax techniques Polynomials Routing Traveling salesman problems
ISSN:	0272-5428
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!