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...
Uložené v:
| Vydané v: | Annual Symposium on Foundations of Computer Science s. 216 - 227 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.10.1976
|
| Predmet: | |
| ISSN: | 0272-5428 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| 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 Xplore POP ALL 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 Electronic Library (IEL) 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/eLvHCXMwlV3PT8IwFH5B4kEvKGDEX-nBo4NubGt7NETiRUICB26k7V51iTCzDeOfb7sNjIkXb00vTV_Tfq_t-74P4F7RsVJMokcDpF4YUfQkct9TzIhEhhRDVptNsNmMr1Zi3oKHAxcGEaviMxy6ZvWXn2R6557KRhbsmXD62keMsZqrtT91Q6drUr2nMKftH_CGi-dTMVpMJ4uhb3F3GP_yUKkgZNr53-Bn0P_h4pH5AWXOoYXbLnT2Zgyk2ZtdOH05CLAWPQgenVb4V1oTE4l8f83ytHzbFMQmqaTINkjybOdKnkljKVP0YTl9Wk6evcYewUsFLT0eKKFjm0DFikYRUsMtNHNJubCQbYz7Uo6QxxZ9tKZGRjhGRkNfJoapSKIeX0B7m23xEohQ9lZkuPZNjKEKtLJTCrlx6maJbfIB9Fw81h-1AMa6CcXV393XcOKCXVe83UC7zHd4C8f6s0yL_K5atW-HWpkT |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGG2ImqgXFDD-tgePDrrRre3REAlGICRw4Eba8lWXCDPbMP75ttvAmHjx1vTS9Gva97X93nsI3SvSVYpJ8EgAxKMhAU8C9z3FjFhKSoCy0myCjcd8PheTGnrYcWEAoCg-g7ZrFn_5y0Rv3FNZx4I9E05fez-kNPBLttb23KVO2aR4UWFO3T_gFRvPJ6Iz7fembd8ibzv65aJSgEi__r_hT1Drh42HJzucOUU1WDdQfWvHgKvd2UDHo50Ea9ZEwaNTC_-KS2oilu-vSRrnb6sM2zQVZ8kKcJpsXNEzrkxlshaa9Z9mvYFXGSR4sSC5xwMldGRTqEiRMARiuAVnLgkXFrSNcZ_KIfDI4o_WxMgQusAI9eXSMBVK0N0ztLdO1nCOsFD2XmS49k0EVAVa2SlRbpy-2dI2-QVqungsPkoJjEUVisu_u-_Q4WA2Gi6Gz-OXK3TkAl_Wv12jvTzdwA060J95nKW3xQp-A64knFo |
| 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 |