Weighted Upper Edge Cover: Complexity and Approximability
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such "flipping" of the objective function was done for many...
Gespeichert in:
| Veröffentlicht in: | Journal of graph algorithms and applications Jg. 24; H. 2; S. 65 - 88 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Brown University
01.02.2020
|
| Schlagworte: | |
| ISSN: | 1526-1719, 1526-1719 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Optimization problems consist of either maximizing or minimizing an objective function.
Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution).
Such "flipping" of the objective function was done for many classical optimization problems.
For example, ${\rm M{\small INIMUM}}$ ${\rm V{\small ERTEX}}$ ${\rm C{\small OVER}}$ becomes ${\rm M{\small AXIMUM}}$ ${\rm M{\small INIMAL}}$ ${\rm V{\small ERTEX}}$ ${\rm C{\small OVER}}$, ${\rm M{\small AXIMUM}}$ ${\rm I{\small NDEPENDENT}}$ ${\rm S{\small ET}}$ becomes ${\rm M{\small INIMUM}}$ ${\rm M{\small AXIMAL}}$ ${\rm I{\small NDEPENDENT}}$ ${\rm S{\small ET}}$ and so on. In this paper, we propose to study the weighted version of Maximum Minimal Edge Cover called ${\rm U{\small PPER}}$ ${\rm E{\small DGE}}$ ${\rm C{\small OVER}}$, a problem having application in genomic sequence alignment.
It is well-known that ${\rm M{\small INIMUM}}$ ${\rm E{\small DGE}}$ ${\rm C{\small OVER}}$ is polynomial-time solvable and the "flipped" version is NP-hard, but constant approximable. We show that the weighted ${\rm U{\small PPER}}$ ${\rm E{\small DGE}}$ ${\rm C{\small OVER}}$ is much more difficult
than ${\rm U{\small PPER}}$ ${\rm E{\small DGE}}$ ${\rm C{\small OVER}}$ because it is not $O(\frac{1}{n^{1/2-\varepsilon}})$ approximable, nor $O(\frac{1}{\Delta^{1-\varepsilon}})$ in edge-weighted graphs of size $n$ and maximum degree $\Delta$ respectively.
Indeed, we give some hardness of approximation results for some special restricted graph classes such as bipartite graphs, split graphs and $k$-trees.
We counter-balance these negative results by giving some positive approximation results in specific graph classes. |
|---|---|
| AbstractList | Optimization problems consist of either maximizing or minimizing an objective function.
Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution).
Such "flipping" of the objective function was done for many classical optimization problems.
For example, ${\rm M{\small INIMUM}}$ ${\rm V{\small ERTEX}}$ ${\rm C{\small OVER}}$ becomes ${\rm M{\small AXIMUM}}$ ${\rm M{\small INIMAL}}$ ${\rm V{\small ERTEX}}$ ${\rm C{\small OVER}}$, ${\rm M{\small AXIMUM}}$ ${\rm I{\small NDEPENDENT}}$ ${\rm S{\small ET}}$ becomes ${\rm M{\small INIMUM}}$ ${\rm M{\small AXIMAL}}$ ${\rm I{\small NDEPENDENT}}$ ${\rm S{\small ET}}$ and so on. In this paper, we propose to study the weighted version of Maximum Minimal Edge Cover called ${\rm U{\small PPER}}$ ${\rm E{\small DGE}}$ ${\rm C{\small OVER}}$, a problem having application in genomic sequence alignment.
It is well-known that ${\rm M{\small INIMUM}}$ ${\rm E{\small DGE}}$ ${\rm C{\small OVER}}$ is polynomial-time solvable and the "flipped" version is NP-hard, but constant approximable. We show that the weighted ${\rm U{\small PPER}}$ ${\rm E{\small DGE}}$ ${\rm C{\small OVER}}$ is much more difficult
than ${\rm U{\small PPER}}$ ${\rm E{\small DGE}}$ ${\rm C{\small OVER}}$ because it is not $O(\frac{1}{n^{1/2-\varepsilon}})$ approximable, nor $O(\frac{1}{\Delta^{1-\varepsilon}})$ in edge-weighted graphs of size $n$ and maximum degree $\Delta$ respectively.
Indeed, we give some hardness of approximation results for some special restricted graph classes such as bipartite graphs, split graphs and $k$-trees.
We counter-balance these negative results by giving some positive approximation results in specific graph classes. |
| Author | Khosravian Ghadikolaei, Mehdi Monnot, Jérôme Sikora, Florian Khoshkhah, Kaveh |
| Author_xml | – sequence: 1 givenname: Kaveh surname: Khoshkhah fullname: Khoshkhah, Kaveh – sequence: 2 givenname: Mehdi surname: Khosravian Ghadikolaei fullname: Khosravian Ghadikolaei, Mehdi – sequence: 3 givenname: Jérôme surname: Monnot fullname: Monnot, Jérôme – sequence: 4 givenname: Florian surname: Sikora fullname: Sikora, Florian |
| BackLink | https://hal.science/hal-02793773$$DView record in HAL |
| BookMark | eNptUE9LwzAcDTLBbXrxE_Sq0JlfsjSptzE2JxS8ODyGNP21y-jakpaxfXtbpyDi6T0e7w-8CRlVdYWE3AOdSRDiaV8YM6NUQHxFxiBYFIKEePSL35BJ2-4pZZxJNSbxB7pi12EWbJsGfbDKCgyW9RH9cw-HpsST686BqbJg0TS-PrmDSV3Za7fkOjdli3ffOCXb9ep9uQmTt5fX5SIJLVMsDlOVxxilKHLkczSMCYsQRXxuuEQOFLiwlPc8x0wBtRAxBIvKQq5So5BPycOld2dK3fh-3591bZzeLBI9aJTJmEvJj9B76cVrfd22HnNtXWc6V1edN67UQPVwkx5u0l839ZHHP5GfjX_Mn5zgalE |
| CitedBy_id | crossref_primary_10_1016_j_jcss_2021_09_001 crossref_primary_10_1016_j_tcs_2021_03_038 |
| ContentType | Journal Article |
| Copyright | Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC |
| DOI | 10.7155/jgaa.00519 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1526-1719 |
| EndPage | 88 |
| ExternalDocumentID | oai:HAL:hal-02793773v1 10_7155_jgaa_00519 |
| GroupedDBID | -~9 29K 2WC 5GY AAFWJ AAKPC AAYXX ACGFO ACIPV AFPKN ALMA_UNASSIGNED_HOLDINGS CITATION D-I E3Z EBS EJD F5P GROUPED_DOAJ M~E OK1 OVT P2P REM RNS TR2 XSB 1XC C1A LO0 |
| ID | FETCH-LOGICAL-c2829-b8f9e6be5fe34ea225ce16634a37e310135c0337efed810c162e1ce8c1f8ba8e3 |
| ISSN | 1526-1719 |
| IngestDate | Tue Oct 14 20:04:06 EDT 2025 Tue Nov 18 01:55:57 EST 2025 Tue Nov 18 21:18:48 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c2829-b8f9e6be5fe34ea225ce16634a37e310135c0337efed810c162e1ce8c1f8ba8e3 |
| ORCID | 0000-0002-8482-1521 0000-0003-2670-6258 0000-0002-7452-6553 |
| OpenAccessLink | https://doi.org/10.7155/jgaa.00519 |
| PageCount | 24 |
| ParticipantIDs | hal_primary_oai_HAL_hal_02793773v1 crossref_citationtrail_10_7155_jgaa_00519 crossref_primary_10_7155_jgaa_00519 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-02-01 |
| PublicationDateYYYYMMDD | 2020-02-01 |
| PublicationDate_xml | – month: 02 year: 2020 text: 2020-02-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of graph algorithms and applications |
| PublicationYear | 2020 |
| Publisher | Brown University |
| Publisher_xml | – name: Brown University |
| SSID | ssj0023278 |
| Score | 2.370429 |
| Snippet | Optimization problems consist of either maximizing or minimizing an objective function.
Instead of looking for a maximum solution (resp. minimum solution), one... |
| SourceID | hal crossref |
| SourceType | Open Access Repository Enrichment Source Index Database |
| StartPage | 65 |
| SubjectTerms | Computational Complexity Computer Science Data Structures and Algorithms Discrete Mathematics |
| Title | Weighted Upper Edge Cover: Complexity and Approximability |
| URI | https://hal.science/hal-02793773 |
| Volume | 24 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1526-1719 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023278 issn: 1526-1719 databaseCode: DOA dateStart: 20030101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1526-1719 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023278 issn: 1526-1719 databaseCode: M~E dateStart: 19970101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6lhQMcEE-1PCoLuKDKYHudeM0toJYemgqJFnqzNvY4azVxoiRYOfFn-KPM7K43acmhHLhY1mbXSTzfzszuzH7D2Ft08UGkkvuyxOkWxxTfLXjs90rgqDKLNNfl3r6fJmdn4vIy_drp_G7PwjTjpK7FapXO_quosQ2FTUdn_0Hc7qHYgPcodLyi2PF6K8H_0Jud6EdezGY6g2NElekoUZP39fQnCsyloV3qE6P4qpoYsu5rEd4NT1WTWh_K8Wg6r5ZqYlidNyPfTmur6UJdKalMnkYDavOTuWxIm3xRsqiucEUNOpFgAKqonNip-LWJjpgIvg7kf4onDn7fcKgujXR4TLmDFtt22wLXqIFLAbGaNur5YWL1JWxps-rZHLG2MIw2dK2pMdFabbHNHiToLZE9GEn5Xjura6vXRvpvGEOXooiLIxqd0dhMj91hd6Kkm5LqHPw6cqt6Hmlz73674cClsR_W33vN69lR7aa9dmLOH7IHVqZe36DmEetA_ZjdHzjq3sUTlrb48TR-PMKPp_Hz0Vujx0MIeDfQ85RdHB-dfz7xbX0NP6f4uT8UZQq9IXRxXsYgUbPnEKIHGkue4EzFxUE3Dzjel1CIMMjDXgRhDiIPSzGUAvgztltPa9hjHoVj0VRBUaJ_zUHKNBqKrkxKKr5aQLDP3rX_P8st-TzVQBlnf7_nffbG9Z0ZypWtvV7ja3QdiCX9pH-aUVsQEeljwpvw-a0e9YLdWyP0Jdtdzn_CK3Y3b5bVYn6gd2kOtMz_AFGkg4Y |
| linkProvider | ISSN International Centre |
| 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=Weighted+Upper+Edge+Cover%3A+Complexity+and+Approximability&rft.jtitle=Journal+of+graph+algorithms+and+applications&rft.au=Khoshkhah%2C+Kaveh&rft.au=Khosravian+Ghadikolaei%2C+Mehdi&rft.au=Monnot%2C+J%C3%A9r%C3%B4me&rft.au=Sikora%2C+Florian&rft.date=2020-02-01&rft.issn=1526-1719&rft.eissn=1526-1719&rft.volume=24&rft.issue=2&rft.spage=65&rft.epage=88&rft_id=info:doi/10.7155%2Fjgaa.00519&rft.externalDBID=n%2Fa&rft.externalDocID=10_7155_jgaa_00519 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1526-1719&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1526-1719&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1526-1719&client=summon |