An Improved Algorithm for Finding Maximum Outerplanar Subgraphs

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:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-06
Hauptverfasser: Calinescu, Gruia, Kaul, Hemanshu, Kudarzi, Bahareh
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Mathematical analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
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.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2825004205</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2825004205</sourcerecordid><originalsourceid>FETCH-proquest_journals_28250042053</originalsourceid><addsrcrecordid>eNqNjEELgjAYQEcQJOV_-KCzsL658hYSSR2iQ91l4tSJ22xz0c_PQz-g0zu8x1uQCBnbJVmKuCKx9z2lFPcH5JxF5JgbuOrR2besIR9a69TUaWisg0KZWpkWbuKjdNBwD5N04yCMcPAIVevE2PkNWTZi8DL-cU22xfl5uiTz8hWkn8reBmdmVWKGnNIUKWf_VV_qAjiY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2825004205</pqid></control><display><type>article</type><title>An Improved Algorithm for Finding Maximum Outerplanar Subgraphs</title><source>Free E- Journals</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>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Approximation ; Mathematical analysis</subject><ispartof>arXiv.org, 2023-06</ispartof><rights>2023. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>780,784</link.rule.ids></links><search><creatorcontrib>Calinescu, Gruia</creatorcontrib><creatorcontrib>Kaul, Hemanshu</creatorcontrib><creatorcontrib>Kudarzi, Bahareh</creatorcontrib><title>An Improved Algorithm for Finding Maximum Outerplanar Subgraphs</title><title>arXiv.org</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>Algorithms</subject><subject>Approximation</subject><subject>Mathematical analysis</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNjEELgjAYQEcQJOV_-KCzsL658hYSSR2iQ91l4tSJ22xz0c_PQz-g0zu8x1uQCBnbJVmKuCKx9z2lFPcH5JxF5JgbuOrR2besIR9a69TUaWisg0KZWpkWbuKjdNBwD5N04yCMcPAIVevE2PkNWTZi8DL-cU22xfl5uiTz8hWkn8reBmdmVWKGnNIUKWf_VV_qAjiY</recordid><startdate>20230614</startdate><enddate>20230614</enddate><creator>Calinescu, Gruia</creator><creator>Kaul, Hemanshu</creator><creator>Kudarzi, Bahareh</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230614</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-proquest_journals_28250042053</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Mathematical analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Calinescu, Gruia</creatorcontrib><creatorcontrib>Kaul, Hemanshu</creatorcontrib><creatorcontrib>Kudarzi, Bahareh</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Calinescu, Gruia</au><au>Kaul, Hemanshu</au><au>Kudarzi, Bahareh</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>An Improved Algorithm for Finding Maximum Outerplanar Subgraphs</atitle><jtitle>arXiv.org</jtitle><date>2023-06-14</date><risdate>2023</risdate><eissn>2331-8422</eissn><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><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-06
issn 2331-8422
language eng
recordid cdi_proquest_journals_2825004205
source Free E- Journals
subjects Algorithms
Approximation
Mathematical analysis
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%3A35%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=An%20Improved%20Algorithm%20for%20Finding%20Maximum%20Outerplanar%20Subgraphs&rft.jtitle=arXiv.org&rft.au=Calinescu,%20Gruia&rft.date=2023-06-14&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2825004205%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2825004205&rft_id=info:pmid/&rfr_iscdi=true