On multiway cut parameterized above lower bounds
We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the node multiway cut problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that node multiway cut is FPT, when parameterized abov...
Gespeichert in:
| Veröffentlicht in: | ACM transactions on computation theory 2013-05, Vol.5 (1), p.1-11 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 11 |
|---|---|
| container_issue | 1 |
| container_start_page | 1 |
| container_title | ACM transactions on computation theory |
| container_volume | 5 |
| creator | Cygan, Marek Pilipczuk, Marcin Pilipczuk, Michał Wojtaszczyk, Jakub Onufry |
| description | We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the
node multiway cut
problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that node multiway cut is FPT, when parameterized above the maximum separating cut, resolving an open problem of Razgon.
Our results imply
O
*
(4
k
) algorithms for vertex cover above maximum matching and almost 2-SAT as well as an
O
*
(2
k
) algorithm for node multiway cut with a standard parameterization by the solution size, improving previous bounds for these problems. |
| doi_str_mv | 10.1145/2462896.2462899 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1506351953</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1506351953</sourcerecordid><originalsourceid>FETCH-LOGICAL-c340t-81e6ea8801d5c885d5e521cff9e6283e85449af19e12126607b2bdddba9427be3</originalsourceid><addsrcrecordid>eNo9kE1LxDAYhIMouK6evfbopbt587XJURa_YGEvei5p8hYqbVOT1mX99VZaPD0zMAzDEHIPdAMg5JYJxbRRm5nmgqzACJbzyV7-aymuyU1Kn5QqxRlfEXrssnZshvpkz5kbh6y30bY4YKx_0Ge2DN-YNeGEMSvD2Pl0S64q2yS8W7gmH89P7_vX_HB8eds_HnLHBR1yDajQak3BS6e19BIlA1dVBqd5HLUUwtgKDAIDphTdlaz03pd2Grorka_Jw9zbx_A1YhqKtk4Om8Z2GMZUgKSKSzCST9HtHHUxpBSxKvpYtzaeC6DF3zfF8s1Cw38BWsdVtg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1506351953</pqid></control><display><type>article</type><title>On multiway cut parameterized above lower bounds</title><source>ACM Digital Library Complete</source><creator>Cygan, Marek ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Wojtaszczyk, Jakub Onufry</creator><creatorcontrib>Cygan, Marek ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Wojtaszczyk, Jakub Onufry</creatorcontrib><description>We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the
node multiway cut
problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that node multiway cut is FPT, when parameterized above the maximum separating cut, resolving an open problem of Razgon.
Our results imply
O
*
(4
k
) algorithms for vertex cover above maximum matching and almost 2-SAT as well as an
O
*
(2
k
) algorithm for node multiway cut with a standard parameterization by the solution size, improving previous bounds for these problems.</description><identifier>ISSN: 1942-3454</identifier><identifier>EISSN: 1942-3462</identifier><identifier>DOI: 10.1145/2462896.2462899</identifier><language>eng</language><subject>Computation ; Linear programming ; Lower bounds ; Mathematical models ; Optimization</subject><ispartof>ACM transactions on computation theory, 2013-05, Vol.5 (1), p.1-11</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c340t-81e6ea8801d5c885d5e521cff9e6283e85449af19e12126607b2bdddba9427be3</citedby><cites>FETCH-LOGICAL-c340t-81e6ea8801d5c885d5e521cff9e6283e85449af19e12126607b2bdddba9427be3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Cygan, Marek</creatorcontrib><creatorcontrib>Pilipczuk, Marcin</creatorcontrib><creatorcontrib>Pilipczuk, Michał</creatorcontrib><creatorcontrib>Wojtaszczyk, Jakub Onufry</creatorcontrib><title>On multiway cut parameterized above lower bounds</title><title>ACM transactions on computation theory</title><description>We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the
node multiway cut
problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that node multiway cut is FPT, when parameterized above the maximum separating cut, resolving an open problem of Razgon.
Our results imply
O
*
(4
k
) algorithms for vertex cover above maximum matching and almost 2-SAT as well as an
O
*
(2
k
) algorithm for node multiway cut with a standard parameterization by the solution size, improving previous bounds for these problems.</description><subject>Computation</subject><subject>Linear programming</subject><subject>Lower bounds</subject><subject>Mathematical models</subject><subject>Optimization</subject><issn>1942-3454</issn><issn>1942-3462</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNo9kE1LxDAYhIMouK6evfbopbt587XJURa_YGEvei5p8hYqbVOT1mX99VZaPD0zMAzDEHIPdAMg5JYJxbRRm5nmgqzACJbzyV7-aymuyU1Kn5QqxRlfEXrssnZshvpkz5kbh6y30bY4YKx_0Ge2DN-YNeGEMSvD2Pl0S64q2yS8W7gmH89P7_vX_HB8eds_HnLHBR1yDajQak3BS6e19BIlA1dVBqd5HLUUwtgKDAIDphTdlaz03pd2Grorka_Jw9zbx_A1YhqKtk4Om8Z2GMZUgKSKSzCST9HtHHUxpBSxKvpYtzaeC6DF3zfF8s1Cw38BWsdVtg</recordid><startdate>201305</startdate><enddate>201305</enddate><creator>Cygan, Marek</creator><creator>Pilipczuk, Marcin</creator><creator>Pilipczuk, Michał</creator><creator>Wojtaszczyk, Jakub Onufry</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201305</creationdate><title>On multiway cut parameterized above lower bounds</title><author>Cygan, Marek ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Wojtaszczyk, Jakub Onufry</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c340t-81e6ea8801d5c885d5e521cff9e6283e85449af19e12126607b2bdddba9427be3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computation</topic><topic>Linear programming</topic><topic>Lower bounds</topic><topic>Mathematical models</topic><topic>Optimization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cygan, Marek</creatorcontrib><creatorcontrib>Pilipczuk, Marcin</creatorcontrib><creatorcontrib>Pilipczuk, Michał</creatorcontrib><creatorcontrib>Wojtaszczyk, Jakub Onufry</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on computation theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cygan, Marek</au><au>Pilipczuk, Marcin</au><au>Pilipczuk, Michał</au><au>Wojtaszczyk, Jakub Onufry</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On multiway cut parameterized above lower bounds</atitle><jtitle>ACM transactions on computation theory</jtitle><date>2013-05</date><risdate>2013</risdate><volume>5</volume><issue>1</issue><spage>1</spage><epage>11</epage><pages>1-11</pages><issn>1942-3454</issn><eissn>1942-3462</eissn><abstract>We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the
node multiway cut
problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that node multiway cut is FPT, when parameterized above the maximum separating cut, resolving an open problem of Razgon.
Our results imply
O
*
(4
k
) algorithms for vertex cover above maximum matching and almost 2-SAT as well as an
O
*
(2
k
) algorithm for node multiway cut with a standard parameterization by the solution size, improving previous bounds for these problems.</abstract><doi>10.1145/2462896.2462899</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1942-3454 |
| ispartof | ACM transactions on computation theory, 2013-05, Vol.5 (1), p.1-11 |
| issn | 1942-3454 1942-3462 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1506351953 |
| source | ACM Digital Library Complete |
| subjects | Computation Linear programming Lower bounds Mathematical models Optimization |
| title | On multiway cut parameterized above lower bounds |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T13%3A58%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20multiway%20cut%20parameterized%20above%20lower%20bounds&rft.jtitle=ACM%20transactions%20on%20computation%20theory&rft.au=Cygan,%20Marek&rft.date=2013-05&rft.volume=5&rft.issue=1&rft.spage=1&rft.epage=11&rft.pages=1-11&rft.issn=1942-3454&rft.eissn=1942-3462&rft_id=info:doi/10.1145/2462896.2462899&rft_dat=%3Cproquest_cross%3E1506351953%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1506351953&rft_id=info:pmid/&rfr_iscdi=true |