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

Saved in:
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!
Abstract 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 modified Traveling Salesman problem). A tour-splitting heuristic is given for k-person variants of the Traveling Salesman problem, the Chinese Postman problem, and the Stacker-Crane problem, for which a minimax solution is sought. This heuristic has a bound of e + 1 - 1/k, where e is the bound for the corresponding 1-person algorithm.
AbstractList 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 modified Traveling Salesman problem). A tour-splitting heuristic is given for k-person variants of the Traveling Salesman problem, the Chinese Postman problem, and the Stacker-Crane problem, for which a minimax solution is sought. This heuristic has a bound of e + 1 - 1/k, where e is the bound for the corresponding 1-person algorithm.
Author Kim, Chul E.
Hecht, Matthew S.
Frederickson, Greg N.
Author_xml – sequence: 1
  givenname: Greg N.
  surname: Frederickson
  fullname: Frederickson, Greg N.
– sequence: 2
  givenname: Matthew S.
  surname: Hecht
  fullname: Hecht, Matthew S.
– sequence: 3
  givenname: Chul E.
  surname: Kim
  fullname: Kim, Chul E.
BookMark eNotjr1OwzAYAD0UibYwdWTxCyR8_rfHKqJQqRJDu1dO-rkYJXFkBwnenkow3XI63YosxjQiIRsGNWPgno-75lgzZ3StF2QJ3PBKSW7vyaqUTwAJCsSS8O005fQdBz_HNFLfX1OO88dQaEiZljQgzelrjuOV3ry2x6E8kLvg-4KP_1yT0-7l1LxVh_fXfbM9VNHBXFneuk5boXQLSiEEC5pZD9YxLkMAxo1Cq600XQfBKxRoQDJ_CaZVHjuxJk9_2YiI5ynfFvPPWSptHGjxCydwQlU
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SFCS.1976.6
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EndPage 227
ExternalDocumentID 4567906
Genre orig-research
GroupedDBID -~X
23M
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ACNCT
ADZIZ
AFFNX
AI.
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IPLJI
OCL
RIE
RIL
RNS
VH1
ID FETCH-LOGICAL-i90t-82b9c68356b055e0f80618a089124ff01275e86847cc0fa5e3e7041adf7b5aec3
IEDL.DBID RIE
ISSN 0272-5428
IngestDate Tue Aug 26 17:09:05 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-82b9c68356b055e0f80618a089124ff01275e86847cc0fa5e3e7041adf7b5aec3
PageCount 12
ParticipantIDs ieee_primary_4567906
PublicationCentury 1900
PublicationDate 1976-Oct.
PublicationDateYYYYMMDD 1976-10-01
PublicationDate_xml – month: 10
  year: 1976
  text: 1976-Oct.
PublicationDecade 1970
PublicationTitle Annual Symposium on Foundations of Computer Science
PublicationTitleAbbrev SFCS
PublicationYear 1976
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0040503
Score 1.2058643
Snippet Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained...
SourceID ieee
SourceType Publisher
StartPage 216
SubjectTerms Approximation algorithms
Cities and towns
Computer science
Cost function
Cranes
Educational institutions
Minimax techniques
Polynomials
Routing
Traveling salesman problems
Title Approximation algorithms for some routing problems
URI https://ieeexplore.ieee.org/document/4567906
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED2VigGWQlvEtzwwktb5cGyPqKJigKpSK9StSpwzRKJNlaSIn4-dpEVILGzWLZbOst_57t47gLvE_AESJVwnlB5zAulxJ5ZMOwabIqFMCI1Vg-zrM59MxGIhpy2433NhELFqPsOBXVa1_CRTW5sqGxqw59Lqax9wzmuu1u7VDayuSZVP4Vbb3xMNF8-lcjgbj2YD1-DuIPw1Q6WCkHHnf5ufQP-Hi0eme5Q5hRauu9DZDWMgzd3swvHLXoC16IH3YLXCv9KamEiij7csT8v3VUFMkEqKbIUkz7a25Zk0I2WKPszHj_PRk9OMR3BSSUtHeLFUoQmgwpgyhlQLA80iokIayNbalpQZitCgj1JURwx95DRwo0TzmEWo_DNor7M1ngORmtNYGaOkGGBMJXqSU0y0r3weKHUBPeuP5aYWwFg2rrj823wFR9bZdcfbNbTLfIs3cKg-y7TIb6tT-waQm5f6
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB1KFdRLta34bQ4e3Tb7kU1ylGKp2JZCi_RWdrOzumC7stuKP99kd1sRvHgLcwlMSN5kZt4bgLtI_wEiJWzLlw6zPOlwK5QstjQ2BULpEBqLBtmXIR-PxXwuJzW433FhELFoPsOOWRa1_ChVG5Mq62qw59Loa-8xz3Pskq21fXc9o2xSZFS4Ufd3RMXGs6nsTvu9acfWyNvxf01RKUCk3_jf9sfQ_mHjkckOZ06ghqsmNLbjGEh1O5twNNpJsOYtcB6MWvhXUlITSfD-mmbJ-m2ZEx2mkjxdIsnSjWl6JtVQmbwNs_7jrDewqgEJViLp2hJOKJWvQyg_pIwhjYUGZxFQITVox7EpKjMUvsYfpWgcMHSRU88OopiHLEDlnkJ9la7wDIiMOQ2VNkqKHoZUoiM5xSh2lcs9pc6hZfyx-CglMBaVKy7-Nt_CwWA2Gi6GT-PnSzg0ji_7366gvs42eA376nOd5NlNcYLfqGObQQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Annual+Symposium+on+Foundations+of+Computer+Science&rft.atitle=Approximation+algorithms+for+some+routing+problems&rft.au=Frederickson%2C+Greg+N.&rft.au=Hecht%2C+Matthew+S.&rft.au=Kim%2C+Chul+E.&rft.date=1976-10-01&rft.pub=IEEE&rft.issn=0272-5428&rft.spage=216&rft.epage=227&rft_id=info:doi/10.1109%2FSFCS.1976.6&rft.externalDocID=4567906
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0272-5428&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0272-5428&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0272-5428&client=summon