Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
Gespeichert in:
| Veröffentlicht in: | SIAM journal on computing 2017-01, Vol.46 (6), p.1712-1744 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1744 |
|---|---|
| container_issue | 6 |
| container_start_page | 1712 |
| container_title | SIAM journal on computing |
| container_volume | 46 |
| creator | Har-Peled, Sariel Quanrud, Kent |
| description | |
| doi_str_mv | 10.1137/16M1079336 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1137_16M1079336</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1137_16M1079336</sourcerecordid><originalsourceid>FETCH-LOGICAL-c297t-29724630578fedb040c3b9334f5563fcefaa5a13b6e7656847e60efcab7467113</originalsourceid><addsrcrecordid>eNpFUE1Lw0AUXETBWL34C3IWVt_r24_mGGpthYge9Bw26a6NJNmwG7D596YoeJlhYBhmhrFbhHtE0g-oXhB0RqTOWIKQSa4R8ZwlAJnmkjJ9ya5i_AJAIZAStsuHIfhj05mx8X2at58-NOOhi6nzIX3z7dT7rjEt3xwH08eTx_T7tPDf_NHOepzSbTDDIV6zC2faaG_-eME-njbv6x0vXrfP67zg9TLTI59hKRSB1Ctn9xUIqKma-wonpSJXW2eMNEiVslpJtRLaKrCuNpUWat5CC3b3m1sHH2OwrhzC3D5MJUJ5-qD8_4B-AL-xTns</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs</title><source>SIAM Journals Online</source><creator>Har-Peled, Sariel ; Quanrud, Kent</creator><creatorcontrib>Har-Peled, Sariel ; Quanrud, Kent</creatorcontrib><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><identifier>DOI: 10.1137/16M1079336</identifier><language>eng</language><ispartof>SIAM journal on computing, 2017-01, Vol.46 (6), p.1712-1744</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c297t-29724630578fedb040c3b9334f5563fcefaa5a13b6e7656847e60efcab7467113</citedby><cites>FETCH-LOGICAL-c297t-29724630578fedb040c3b9334f5563fcefaa5a13b6e7656847e60efcab7467113</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,3171,27901,27902</link.rule.ids></links><search><creatorcontrib>Har-Peled, Sariel</creatorcontrib><creatorcontrib>Quanrud, Kent</creatorcontrib><title>Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs</title><title>SIAM journal on computing</title><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNpFUE1Lw0AUXETBWL34C3IWVt_r24_mGGpthYge9Bw26a6NJNmwG7D596YoeJlhYBhmhrFbhHtE0g-oXhB0RqTOWIKQSa4R8ZwlAJnmkjJ9ya5i_AJAIZAStsuHIfhj05mx8X2at58-NOOhi6nzIX3z7dT7rjEt3xwH08eTx_T7tPDf_NHOepzSbTDDIV6zC2faaG_-eME-njbv6x0vXrfP67zg9TLTI59hKRSB1Ctn9xUIqKma-wonpSJXW2eMNEiVslpJtRLaKrCuNpUWat5CC3b3m1sHH2OwrhzC3D5MJUJ5-qD8_4B-AL-xTns</recordid><startdate>201701</startdate><enddate>201701</enddate><creator>Har-Peled, Sariel</creator><creator>Quanrud, Kent</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201701</creationdate><title>Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs</title><author>Har-Peled, Sariel ; Quanrud, Kent</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c297t-29724630578fedb040c3b9334f5563fcefaa5a13b6e7656847e60efcab7467113</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Har-Peled, Sariel</creatorcontrib><creatorcontrib>Quanrud, Kent</creatorcontrib><collection>CrossRef</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Har-Peled, Sariel</au><au>Quanrud, Kent</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs</atitle><jtitle>SIAM journal on computing</jtitle><date>2017-01</date><risdate>2017</risdate><volume>46</volume><issue>6</issue><spage>1712</spage><epage>1744</epage><pages>1712-1744</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><doi>10.1137/16M1079336</doi><tpages>33</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0097-5397 |
| ispartof | SIAM journal on computing, 2017-01, Vol.46 (6), p.1712-1744 |
| issn | 0097-5397 1095-7111 |
| language | eng |
| recordid | cdi_crossref_primary_10_1137_16M1079336 |
| source | SIAM Journals Online |
| title | Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T21%3A16%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Approximation%20Algorithms%20for%20Polynomial-Expansion%20and%20Low-Density%20Graphs&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=Har-Peled,%20Sariel&rft.date=2017-01&rft.volume=46&rft.issue=6&rft.spage=1712&rft.epage=1744&rft.pages=1712-1744&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/10.1137/16M1079336&rft_dat=%3Ccrossref%3E10_1137_16M1079336%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |