A 9 7 -approximation algorithm for Graphic TSP in cubic bipartite graphs

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 209; s. 164 - 216
Hlavní autori: Karp, Jeremy A., Ravi, R.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: 20.08.2016
ISSN:0166-218X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Author Ravi, R.
Karp, Jeremy A.
Author_xml – sequence: 1
  givenname: Jeremy A.
  surname: Karp
  fullname: Karp, Jeremy A.
– sequence: 2
  givenname: R.
  surname: Ravi
  fullname: Ravi, R.
BookMark eNp9j9FKwzAUhnMxwW36AN7lBVpz2qRpLsfQTRgoOMG7kqbJltI2JY2gb2_qvPLCq8P3H_7D-VZoMbhBI3QHJAUCxX2bNrJPMwIsckrycoGWMS-SDMr3a7SappYQApGWaL_BAnOcyHH07tP2Mlg3YNmdnLfh3GPjPN55OZ6twsfXF2wHrD7qCLUdpQ82aHya19MNujKym_Tt71yjt8eH43afHJ53T9vNIVHAWUi0pkRnZcGYyQRvRGMEzYGBUUYKAwXNTFHTnGtRlqzOuSk0zyllAA0VnDb5GsHlrvJumrw21ejj2_6rAlLN-lVbRf1q1p-jqB87_E9H2fBjGry03T_Nb0dXY64
CitedBy_id crossref_primary_10_1016_j_disopt_2017_05_003
crossref_primary_10_1016_j_orl_2018_04_007
Cites_doi 10.1137/0202019
10.1016/j.orl.2004.09.005
10.1007/BF01585563
10.1137/140972925
10.1007/s00493-014-2960-3
10.1007/978-3-319-33461-5_21
10.1007/s10107-012-0620-1
10.1007/978-3-662-44777-2_61
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1016/j.dam.2015.10.038
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EndPage 216
ExternalDocumentID 10_1016_j_dam_2015_10_038
GroupedDBID -~X
AAYXX
ADEZE
AFTJW
AI.
ALMA_UNASSIGNED_HOLDINGS
CITATION
FA8
FDB
OAUVE
VH1
WUQ
ID FETCH-LOGICAL-c175t-ee40e28655f297d9df943151fcfa9f1642f6b437e9885b37f6e7344511d4974d3
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000379280600020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0166-218X
IngestDate Sat Nov 29 02:59:35 EST 2025
Tue Nov 18 22:13:59 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c175t-ee40e28655f297d9df943151fcfa9f1642f6b437e9885b37f6e7344511d4974d3
PageCount 53
ParticipantIDs crossref_primary_10_1016_j_dam_2015_10_038
crossref_citationtrail_10_1016_j_dam_2015_10_038
PublicationCentury 2000
PublicationDate 2016-08-20
PublicationDateYYYYMMDD 2016-08-20
PublicationDate_xml – month: 08
  year: 2016
  text: 2016-08-20
  day: 20
PublicationDecade 2010
PublicationTitle Discrete Applied Mathematics
PublicationYear 2016
References Gamarnik (10.1016/j.dam.2015.10.038_br000040) 2005; 33
Dantzig (10.1016/j.dam.2015.10.038_br000030) 1954
10.1016/j.dam.2015.10.038_br000075
Gharan (10.1016/j.dam.2015.10.038_br000045) 2011
10.1016/j.dam.2015.10.038_br000065
Correa (10.1016/j.dam.2015.10.038_br000025) 2015; 29
Boyd (10.1016/j.dam.2015.10.038_br000015) 2014; 144
10.1016/j.dam.2015.10.038_br000005
Barnette (10.1016/j.dam.2015.10.038_br000010) 1969; 343
Mömke (10.1016/j.dam.2015.10.038_br000060) 2011
Christofides (10.1016/j.dam.2015.10.038_br000020) 1976
Vishnoi (10.1016/j.dam.2015.10.038_br000080) 2012
Sebő (10.1016/j.dam.2015.10.038_br000070) 2014
Goemans (10.1016/j.dam.2015.10.038_br000050) 1995; 69
Feige (10.1016/j.dam.2015.10.038_br000035) 2014
Hopcroft (10.1016/j.dam.2015.10.038_br000055) 1973; 2
References_xml – start-page: 273
  year: 2014
  ident: 10.1016/j.dam.2015.10.038_br000035
  article-title: Short tours through large linear forests
– volume: 2
  start-page: 225
  issue: 4
  year: 1973
  ident: 10.1016/j.dam.2015.10.038_br000055
  article-title: An nˆ5/2 algorithm for maximum matchings in bipartite graphs
  publication-title: SIAM J. Comput.
  doi: 10.1137/0202019
– start-page: 76
  year: 2012
  ident: 10.1016/j.dam.2015.10.038_br000080
  article-title: A permanent approach to the traveling salesman problem
– volume: 33
  start-page: 467
  issue: 5
  year: 2005
  ident: 10.1016/j.dam.2015.10.038_br000040
  article-title: An improved upper bound for the TSP in cubic 3-edge-connected graphs
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2004.09.005
– volume: 69
  start-page: 335
  issue: 1–3
  year: 1995
  ident: 10.1016/j.dam.2015.10.038_br000050
  article-title: Worst-case comparison of valid inequalities for the TSP
  publication-title: Math. Program.
  doi: 10.1007/BF01585563
– volume: 29
  start-page: 915
  issue: 2
  year: 2015
  ident: 10.1016/j.dam.2015.10.038_br000025
  article-title: TSP tours in cubic graphs: beyond 4/3
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/140972925
– start-page: 550
  year: 2011
  ident: 10.1016/j.dam.2015.10.038_br000045
  article-title: A randomized rounding approach to the traveling salesman problem
– year: 2014
  ident: 10.1016/j.dam.2015.10.038_br000070
  article-title: Shorter tours by nicer ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
  publication-title: Combinatorica
  doi: 10.1007/s00493-014-2960-3
– start-page: 560
  year: 2011
  ident: 10.1016/j.dam.2015.10.038_br000060
  article-title: Approximating graphic TSP by matchings
– volume: 343
  year: 1969
  ident: 10.1016/j.dam.2015.10.038_br000010
  article-title: Conjecture 5
  publication-title: Recent Prog. Combin.
– year: 1976
  ident: 10.1016/j.dam.2015.10.038_br000020
– ident: 10.1016/j.dam.2015.10.038_br000075
  doi: 10.1007/978-3-319-33461-5_21
– ident: 10.1016/j.dam.2015.10.038_br000005
– start-page: 393
  year: 1954
  ident: 10.1016/j.dam.2015.10.038_br000030
  article-title: Solution of a large-scale traveling-salesman problem
  publication-title: J. Oper. Res. Soc. Amer.
– volume: 144
  start-page: 227
  issue: 1–2
  year: 2014
  ident: 10.1016/j.dam.2015.10.038_br000015
  article-title: The traveling salesman problem on cubic and subcubic graphs
  publication-title: Math. Program.
  doi: 10.1007/s10107-012-0620-1
– ident: 10.1016/j.dam.2015.10.038_br000065
  doi: 10.1007/978-3-662-44777-2_61
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.150314
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 164
Title A 9 7 -approximation algorithm for Graphic TSP in cubic bipartite graphs
A 9/7-approximation algorithm for graphic TSP in cubic bipartite graphs
Volume 209
WOSCitedRecordID wos000379280600020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 20171231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0001218
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtZ3Pb5swFMetLO2hO0zt2qldu8mHnYaIwDEYH9Ga9YfUqtoyKTcExrRUKYkIifLn9xkT4maq1Bx6QQGRB-RD7Ofn975G6IeQwqFSZrakXNhUBI7NRZLCKEX4JOkzKj292AS7vQ1GI37X6bRV_IsxK4pgueTTd0UNxwC2Kp3dAndrFA7AZ4AOW8AO2zeBDy1uMcuuxcKXua5MtOLx_aTMq4enOq3wQqlU58Ia_r1T8Q4xT2AnyafKWiWtWsR6Zrqt5zm0LuBet07rTav2up4MisupzpcpVYlK2FtPIS3qlIE_PTPE4PoqZkocM-ro-zb4AiOz2SQONxo-V2uRN30o0fWT_zXPOlLwCFdSIgCu11OJdVrd5aUU9kYX1SYOrnLSHiMwESkTsB-BiQ9ohzCPB120E14NRteGhJjSx9tbBd3Wc0zga9FG-V0_3GrOu87-27hDw2sx3I_hPvrUjBtwqHkfoI4sPqOPBoZDdBlijhl-SR635DGQxw15DORxXuCaPG7JY03-CP37PRj-urSbhTJsAd5fZUtJHVmXGGeEs5SnGQe_0HMzkcU8AzQk8xPaZ5IHgQd_wMyXrF8r06UUxpNp_wvqFpNCHiMcE8cjMSMpDIOpkrH205g6BK7gSy64e4Kc1Q8RiUZFXi1mMo5eRXOCfrZfmWoJlddP_rrNyadob_26nqFuVc7lN7QrFlU-K783b8Iz1iFiuA
linkProvider Elsevier
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=article&rft.atitle=A+9+7+-approximation+algorithm+for+Graphic+TSP+in+cubic+bipartite+graphs&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Karp%2C+Jeremy+A.&rft.au=Ravi%2C+R.&rft.date=2016-08-20&rft.issn=0166-218X&rft.volume=209&rft.spage=164&rft.epage=216&rft_id=info:doi/10.1016%2Fj.dam.2015.10.038&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_dam_2015_10_038
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon