An Improved Algorithm for Finding Maximum Outerplanar Subgraphs
We study the NP-complete Maximum Outerplanar Subgraph problem. The previous best known approximation ratio for this problem is 2/3. We propose a new approximation algorithm which improves the ratio to 7/10.
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Calinescu, Gruia Kaul, Hemanshu Kudarzi, Bahareh |
| description | We study the NP-complete Maximum Outerplanar Subgraph problem. The previous
best known approximation ratio for this problem is 2/3. We propose a new
approximation algorithm which improves the ratio to 7/10. |
| doi_str_mv | 10.48550/arxiv.2306.05588 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2306_05588</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2306_05588</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-e09c935068734c899dfb95b374bc2464dae214c523851a5720ff210cb2b29fac3</originalsourceid><addsrcrecordid>eNotz7FuwjAUQFEvHSrKB3SqfyCpY_sl9lRFqBQkKoayR8-OHSzFSWQIgr-voJ3udqVDyGvBcqkA2Duma7jkXLAyZwBKPZOPeqDbOKXx4lpa992YwvkYqR8TXYehDUNHv_Ea4hzpfj67NPU4YKI_s-kSTsfTC3ny2J_c8r8Lclh_HlabbLf_2q7qXYZlpTLHtNUCWKkqIa3SuvVGgxGVNJbLUrboeCEtcKGgQKg4854XzBpuuPZoxYK8_W0fgmZKIWK6NXdJ85CIX5S-QxA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>An Improved Algorithm for Finding Maximum Outerplanar Subgraphs</title><source>arXiv.org</source><creator>Calinescu, Gruia ; Kaul, Hemanshu ; Kudarzi, Bahareh</creator><creatorcontrib>Calinescu, Gruia ; Kaul, Hemanshu ; Kudarzi, Bahareh</creatorcontrib><description>We study the NP-complete Maximum Outerplanar Subgraph problem. The previous
best known approximation ratio for this problem is 2/3. We propose a new
approximation algorithm which improves the ratio to 7/10.</description><identifier>DOI: 10.48550/arxiv.2306.05588</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Mathematics - Combinatorics</subject><creationdate>2023-06</creationdate><rights>http://creativecommons.org/licenses/by-nc-nd/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2306.05588$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2306.05588$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Calinescu, Gruia</creatorcontrib><creatorcontrib>Kaul, Hemanshu</creatorcontrib><creatorcontrib>Kudarzi, Bahareh</creatorcontrib><title>An Improved Algorithm for Finding Maximum Outerplanar Subgraphs</title><description>We study the NP-complete Maximum Outerplanar Subgraph problem. The previous
best known approximation ratio for this problem is 2/3. We propose a new
approximation algorithm which improves the ratio to 7/10.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FuwjAUQFEvHSrKB3SqfyCpY_sl9lRFqBQkKoayR8-OHSzFSWQIgr-voJ3udqVDyGvBcqkA2Duma7jkXLAyZwBKPZOPeqDbOKXx4lpa992YwvkYqR8TXYehDUNHv_Ea4hzpfj67NPU4YKI_s-kSTsfTC3ny2J_c8r8Lclh_HlabbLf_2q7qXYZlpTLHtNUCWKkqIa3SuvVGgxGVNJbLUrboeCEtcKGgQKg4854XzBpuuPZoxYK8_W0fgmZKIWK6NXdJ85CIX5S-QxA</recordid><startdate>20230608</startdate><enddate>20230608</enddate><creator>Calinescu, Gruia</creator><creator>Kaul, Hemanshu</creator><creator>Kudarzi, Bahareh</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20230608</creationdate><title>An Improved Algorithm for Finding Maximum Outerplanar Subgraphs</title><author>Calinescu, Gruia ; Kaul, Hemanshu ; Kudarzi, Bahareh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-e09c935068734c899dfb95b374bc2464dae214c523851a5720ff210cb2b29fac3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Calinescu, Gruia</creatorcontrib><creatorcontrib>Kaul, Hemanshu</creatorcontrib><creatorcontrib>Kudarzi, Bahareh</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Calinescu, Gruia</au><au>Kaul, Hemanshu</au><au>Kudarzi, Bahareh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Improved Algorithm for Finding Maximum Outerplanar Subgraphs</atitle><date>2023-06-08</date><risdate>2023</risdate><abstract>We study the NP-complete Maximum Outerplanar Subgraph problem. The previous
best known approximation ratio for this problem is 2/3. We propose a new
approximation algorithm which improves the ratio to 7/10.</abstract><doi>10.48550/arxiv.2306.05588</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2306.05588 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2306_05588 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms Mathematics - Combinatorics |
| title | An Improved Algorithm for Finding Maximum Outerplanar Subgraphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T12%3A39%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Improved%20Algorithm%20for%20Finding%20Maximum%20Outerplanar%20Subgraphs&rft.au=Calinescu,%20Gruia&rft.date=2023-06-08&rft_id=info:doi/10.48550/arxiv.2306.05588&rft_dat=%3Carxiv_GOX%3E2306_05588%3C/arxiv_GOX%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 |