Improved Approximations for Tour and Tree Covers
A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph. Arkin, Halldórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover)....
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 193 |
|---|---|
| container_issue | |
| container_start_page | 184 |
| container_title | |
| container_volume | 1913 |
| creator | Könemann, Jochen Konjevod, Goran Parekh, Ojas Sinha, Amitabh |
| description | A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph.
Arkin, Halldórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems. |
| doi_str_mv | 10.1007/3-540-44436-X_19 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_779735</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072870_24_199</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1819-20eafccb2a310fc5b361b6e325352761dff0bee0b1a8ef9788a250dcef10a43b3</originalsourceid><addsrcrecordid>eNo9UMtOwzAQNE8Rld45RuLssvbGcXysKh6VKnEpEjfLcWwotEmwUwR_j_sQe9nV7sxodgi5YTBhAPIOqSiAFkWBJX3VTJ2QsZIVpuV-J09JxkrGKGKhzv5vpVSqlOckAwROlSzwkmQKBVdMVOKKjGP8gFTIGUqeEZhv-tB9uyaf9mn4WW3MsOramPsu5MtuG3LTNvkyOJfPEizEa3LhzTq68bGPyMvD_XL2RBfPj_PZdEF7VjFFOTjjra25QQbeihpLVpcOuUheZMka76F2DmpmKueT-cpwAY11noEpsMYRuT3o9iZas_bBtHYVdR-Sw_CrpVQSRUJNDqiYDu2bC7ruus-oGehdiBp1ykTvA9O7EBMBj7Kh-9q6OGi3Y1jXDsGs7bvph_SkRpC8kqB5kUgK_wCZPm6I</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072870_24_199</pqid></control><display><type>book_chapter</type><title>Improved Approximations for Tour and Tree Covers</title><source>Springer Books</source><creator>Könemann, Jochen ; Konjevod, Goran ; Parekh, Ojas ; Sinha, Amitabh</creator><contributor>Jansen, Klaus ; Khuller, Samir ; Khuller, Samir ; Jansen, Klaus</contributor><creatorcontrib>Könemann, Jochen ; Konjevod, Goran ; Parekh, Ojas ; Sinha, Amitabh ; Jansen, Klaus ; Khuller, Samir ; Khuller, Samir ; Jansen, Klaus</creatorcontrib><description>A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph.
Arkin, Halldórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540679967</identifier><identifier>ISBN: 3540679960</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540444367</identifier><identifier>EISBN: 354044436X</identifier><identifier>DOI: 10.1007/3-540-44436-X_19</identifier><identifier>OCLC: 935291585</identifier><identifier>LCCallNum: QA76.6-76.66</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Algorithms for functional approximation ; Applied sciences ; Approximations and expansions ; Electronics ; Exact sciences and technology ; Function theory, analysis ; Hardware ; Linear Programming Relaxation ; Mathematical methods in physics ; Numerical approximation and analysis ; Physics ; Steiner Tree ; Steiner Tree Problem ; Tree Cover ; Vertex Cover</subject><ispartof>Approximation Algorithms for Combinatorial Optimization, 2000, Vol.1913, p.184-193</ispartof><rights>Springer-Verlag Berlin Heidelberg 2000</rights><rights>2001 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072870-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-44436-X_19$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-44436-X_19$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,776,777,781,786,787,790,4036,4037,27906,38236,41423,42492</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=779735$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Jansen, Klaus</contributor><contributor>Khuller, Samir</contributor><contributor>Khuller, Samir</contributor><contributor>Jansen, Klaus</contributor><creatorcontrib>Könemann, Jochen</creatorcontrib><creatorcontrib>Konjevod, Goran</creatorcontrib><creatorcontrib>Parekh, Ojas</creatorcontrib><creatorcontrib>Sinha, Amitabh</creatorcontrib><title>Improved Approximations for Tour and Tree Covers</title><title>Approximation Algorithms for Combinatorial Optimization</title><description>A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph.
Arkin, Halldórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems.</description><subject>Algorithms for functional approximation</subject><subject>Applied sciences</subject><subject>Approximations and expansions</subject><subject>Electronics</subject><subject>Exact sciences and technology</subject><subject>Function theory, analysis</subject><subject>Hardware</subject><subject>Linear Programming Relaxation</subject><subject>Mathematical methods in physics</subject><subject>Numerical approximation and analysis</subject><subject>Physics</subject><subject>Steiner Tree</subject><subject>Steiner Tree Problem</subject><subject>Tree Cover</subject><subject>Vertex Cover</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540679967</isbn><isbn>3540679960</isbn><isbn>9783540444367</isbn><isbn>354044436X</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2000</creationdate><recordtype>book_chapter</recordtype><recordid>eNo9UMtOwzAQNE8Rld45RuLssvbGcXysKh6VKnEpEjfLcWwotEmwUwR_j_sQe9nV7sxodgi5YTBhAPIOqSiAFkWBJX3VTJ2QsZIVpuV-J09JxkrGKGKhzv5vpVSqlOckAwROlSzwkmQKBVdMVOKKjGP8gFTIGUqeEZhv-tB9uyaf9mn4WW3MsOramPsu5MtuG3LTNvkyOJfPEizEa3LhzTq68bGPyMvD_XL2RBfPj_PZdEF7VjFFOTjjra25QQbeihpLVpcOuUheZMka76F2DmpmKueT-cpwAY11noEpsMYRuT3o9iZas_bBtHYVdR-Sw_CrpVQSRUJNDqiYDu2bC7ruus-oGehdiBp1ykTvA9O7EBMBj7Kh-9q6OGi3Y1jXDsGs7bvph_SkRpC8kqB5kUgK_wCZPm6I</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Könemann, Jochen</creator><creator>Konjevod, Goran</creator><creator>Parekh, Ojas</creator><creator>Sinha, Amitabh</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2000</creationdate><title>Improved Approximations for Tour and Tree Covers</title><author>Könemann, Jochen ; Konjevod, Goran ; Parekh, Ojas ; Sinha, Amitabh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1819-20eafccb2a310fc5b361b6e325352761dff0bee0b1a8ef9788a250dcef10a43b3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Algorithms for functional approximation</topic><topic>Applied sciences</topic><topic>Approximations and expansions</topic><topic>Electronics</topic><topic>Exact sciences and technology</topic><topic>Function theory, analysis</topic><topic>Hardware</topic><topic>Linear Programming Relaxation</topic><topic>Mathematical methods in physics</topic><topic>Numerical approximation and analysis</topic><topic>Physics</topic><topic>Steiner Tree</topic><topic>Steiner Tree Problem</topic><topic>Tree Cover</topic><topic>Vertex Cover</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Könemann, Jochen</creatorcontrib><creatorcontrib>Konjevod, Goran</creatorcontrib><creatorcontrib>Parekh, Ojas</creatorcontrib><creatorcontrib>Sinha, Amitabh</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Könemann, Jochen</au><au>Konjevod, Goran</au><au>Parekh, Ojas</au><au>Sinha, Amitabh</au><au>Jansen, Klaus</au><au>Khuller, Samir</au><au>Khuller, Samir</au><au>Jansen, Klaus</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Improved Approximations for Tour and Tree Covers</atitle><btitle>Approximation Algorithms for Combinatorial Optimization</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2000</date><risdate>2000</risdate><volume>1913</volume><spage>184</spage><epage>193</epage><pages>184-193</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540679967</isbn><isbn>3540679960</isbn><eisbn>9783540444367</eisbn><eisbn>354044436X</eisbn><abstract>A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph.
Arkin, Halldórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-44436-X_19</doi><oclcid>935291585</oclcid><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Approximation Algorithms for Combinatorial Optimization, 2000, Vol.1913, p.184-193 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_779735 |
| source | Springer Books |
| subjects | Algorithms for functional approximation Applied sciences Approximations and expansions Electronics Exact sciences and technology Function theory, analysis Hardware Linear Programming Relaxation Mathematical methods in physics Numerical approximation and analysis Physics Steiner Tree Steiner Tree Problem Tree Cover Vertex Cover |
| title | Improved Approximations for Tour and Tree Covers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T10%3A10%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Improved%20Approximations%20for%20Tour%20and%20Tree%20Covers&rft.btitle=Approximation%20Algorithms%20for%20Combinatorial%20Optimization&rft.au=K%C3%B6nemann,%20Jochen&rft.date=2000&rft.volume=1913&rft.spage=184&rft.epage=193&rft.pages=184-193&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540679967&rft.isbn_list=3540679960&rft_id=info:doi/10.1007/3-540-44436-X_19&rft_dat=%3Cproquest_pasca%3EEBC3072870_24_199%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540444367&rft.eisbn_list=354044436X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072870_24_199&rft_id=info:pmid/&rfr_iscdi=true |