Linear Kernels and Linear-Time Algorithms for Finding Large Cuts

The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be fixed-parameter tractable and admit polynomial kernels when parameterized above the tight lower bound measured by the size and order of the graph....

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 80; číslo 9; s. 2574 - 2615
Hlavní autoři:	Etscheid, Michael, Mnich, Matthias
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.09.2018 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Informatics Kernels Lower bounds Mathematics of Computing Run time (computers) Special Issue dedicated to the 60th Birthday of Gregory Gutin Theory of Computation 68W05 68R10 Linear-time algorithms 05C85 Max-cut Kernelization
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be fixed-parameter tractable and admit polynomial kernels when parameterized above the tight lower bound measured by the size and order of the graph. In this paper we continue this line of research and considerably improve several of those results: We show that an algorithm by Crowston et al. (Algorithmica 72(3):734–757, 2015 ) for (Signed) Max-Cut Above Edwards−Erd ő s Bound can be implemented so as to run in linear time 8 k · O ( m ) ; this significantly improves the previous analysis with run time 8 k · O ( n 4 ) . We give an asymptotically optimal kernel for (Signed) Max-Cut Above Edwards−Erd ő s Bound with O ( k ) vertices, improving a kernel with O ( k 3 ) vertices by Crowston et al. (Theor Comput Sci 513:53–64, 2013 ). We improve all known kernels for parameterizations above strongly λ -extendible properties (a generalization of the Max-Cut results) by Crowston et al. (Proceedings of FSTTCS 2013, Leibniz international proceedings in informatics, Guwahati, 2013 ) from O ( k 3 ) vertices to O ( k ) vertices. Therefore, Max Acyclic Subdigraph parameterized above Poljak–Turzík bound admits a kernel with O ( k ) vertices and can be solved in 2 O ( k ) · n O ( 1 ) time; this answers an open question by Crowston et al. (Proceedings of FSTTCS 2012, Leibniz international proceedings in informatics, Hyderabad, 2012 ). All presented kernels can be computed in time O ( km ).
AbstractList	The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be fixed-parameter tractable and admit polynomial kernels when parameterized above the tight lower bound measured by the size and order of the graph. In this paper we continue this line of research and considerably improve several of those results:We show that an algorithm by Crowston et al. (Algorithmica 72(3):734–757, 2015) for (Signed) Max-Cut Above Edwards−Erdős Bound can be implemented so as to run in linear time8k·O(m); this significantly improves the previous analysis with run time 8k·O(n4).We give an asymptotically optimal kernel for (Signed) Max-Cut Above Edwards−Erdős Bound with O(k) vertices, improving a kernel with O(k3) vertices by Crowston et al. (Theor Comput Sci 513:53–64, 2013).We improve all known kernels for parameterizations above strongly λ-extendible properties (a generalization of the Max-Cut results) by Crowston et al. (Proceedings of FSTTCS 2013, Leibniz international proceedings in informatics, Guwahati, 2013) from O(k3) vertices to O(k) vertices.Therefore, Max Acyclic Subdigraph parameterized above Poljak–Turzík bound admits a kernel with O(k) vertices and can be solved in 2O(k)·nO(1) time; this answers an open question by Crowston et al. (Proceedings of FSTTCS 2012, Leibniz international proceedings in informatics, Hyderabad, 2012). All presented kernels can be computed in time O(km). The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be fixed-parameter tractable and admit polynomial kernels when parameterized above the tight lower bound measured by the size and order of the graph. In this paper we continue this line of research and considerably improve several of those results: We show that an algorithm by Crowston et al. (Algorithmica 72(3):734–757, 2015 ) for (Signed) Max-Cut Above Edwards−Erd ő s Bound can be implemented so as to run in linear time 8 k · O ( m ) ; this significantly improves the previous analysis with run time 8 k · O ( n 4 ) . We give an asymptotically optimal kernel for (Signed) Max-Cut Above Edwards−Erd ő s Bound with O ( k ) vertices, improving a kernel with O ( k 3 ) vertices by Crowston et al. (Theor Comput Sci 513:53–64, 2013 ). We improve all known kernels for parameterizations above strongly λ -extendible properties (a generalization of the Max-Cut results) by Crowston et al. (Proceedings of FSTTCS 2013, Leibniz international proceedings in informatics, Guwahati, 2013 ) from O ( k 3 ) vertices to O ( k ) vertices. Therefore, Max Acyclic Subdigraph parameterized above Poljak–Turzík bound admits a kernel with O ( k ) vertices and can be solved in 2 O ( k ) · n O ( 1 ) time; this answers an open question by Crowston et al. (Proceedings of FSTTCS 2012, Leibniz international proceedings in informatics, Hyderabad, 2012 ). All presented kernels can be computed in time O ( km ).
Author	Etscheid, Michael Mnich, Matthias
Author_xml	– sequence: 1 givenname: Michael surname: Etscheid fullname: Etscheid, Michael organization: Institut für Informatik, Universität Bonn – sequence: 2 givenname: Matthias surname: Mnich fullname: Mnich, Matthias email: mmnich@uni-bonn.de, m.mnich@maastrichtuniversity.nl organization: Institut für Informatik, Universität Bonn, Department of Quantitative Economics, Maastricht University
BookMark	eNp9kM9LwzAUx4NMcJv-Ad4CnqP51Sa5OYZTseBlnkPaJjWjS2fSHtxfb0cFQdDTg_e-n_cenwWYhS5YAK4JviUYi7uEMc8YwkQgzKRExzMwJ5xRhDNOZmA-DiTiOREXYJHSDmNChcrn4L7wwZoIX2wMtk3QhBpOLbT1ewtXbdNF37_vE3RdhBsfah8aWJjYWLge-nQJzp1pk736rkvwtnnYrp9Q8fr4vF4VqGKZ6pFiuVDUEWyrnGfEMG5qwSUrReakqQTJMqNUaRynJZMVK1XpqKulUY6X1Dm2BDfT3kPsPgaber3rhhjGk5piTiUmhORjSkypKnYpRet05XvT-y700fhWE6xPuvSkS49W9EmXPo4k-UUeot-b-PkvQycmjdnQ2Pjz09_QF8oTflw
CitedBy_id	crossref_primary_10_1007_s00224_018_9858_1 crossref_primary_10_1016_j_tcs_2020_11_030 crossref_primary_10_1007_s00453_025_01306_y crossref_primary_10_1007_s13218_017_0518_4 crossref_primary_10_1137_17M1148566 crossref_primary_10_1016_j_tcs_2018_06_027 crossref_primary_10_1137_18M1176087
Cites_doi	10.1016/j.ipl.2010.08.001 10.1016/j.tcs.2005.10.010 10.1016/j.jcss.2008.08.004 10.1016/j.ipl.2007.05.014 10.1016/0012-365X(86)90192-5 10.1007/s10878-009-9212-2 10.1088/0305-4470/15/10/028 10.1137/16M1061862 10.1016/j.jcss.2014.04.011 10.4153/CJM-1973-048-x 10.1016/j.jcss.2011.01.004 10.1006/jcss.2001.1774 10.1007/s00224-007-1330-6 10.1007/s00453-014-9870-z 10.1017/S0963548300000596 10.1109/TCAD.2006.882642 10.1016/j.tcs.2013.10.026 10.1016/S0304-3975(99)00150-4 10.1093/imaman/13.3.201 10.1002/bs.3830040405 10.1016/j.jcss.2013.10.002 10.1007/BF01456961 10.1137/140962838 10.1007/s00453-010-9428-7 10.1090/dimacs/020/04 10.1007/978-1-4684-2001-2_9 10.1007/978-3-662-47672-7_76
ContentType	Journal Article
Copyright	The Author(s) 2017 Copyright Springer Science & Business Media 2018
Copyright_xml	– notice: The Author(s) 2017 – notice: Copyright Springer Science & Business Media 2018
DBID	C6C AAYXX CITATION JQ2
DOI	10.1007/s00453-017-0388-z
DatabaseName	Springer Nature OA Free Journals CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1432-0541
EndPage	2615
ExternalDocumentID	10_1007_s00453_017_0388_z
GrantInformation_xml	– fundername: European Research Council grantid: 306465 funderid: http://dx.doi.org/10.13039/501100000781
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS C6C CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION JQ2
ID	FETCH-LOGICAL-c359t-936792f10ec6451a34ad7483b75f8ac7155a99baf42b38c3b9bf2fd8a9f4b2ff3
IEDL.DBID	RSV
ISICitedReferencesCount	9
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000433025100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-4617
IngestDate	Sun Nov 09 08:21:37 EST 2025 Tue Nov 18 21:43:31 EST 2025 Sat Nov 29 02:20:28 EST 2025 Fri Feb 21 02:43:08 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	9
Keywords	68W05 68R10 Linear-time algorithms 05C85 Max-cut Kernelization
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c359t-936792f10ec6451a34ad7483b75f8ac7155a99baf42b38c3b9bf2fd8a9f4b2ff3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
OpenAccessLink	https://link.springer.com/10.1007/s00453-017-0388-z
PQID	2042801116
PQPubID	2043795
PageCount	42
ParticipantIDs	proquest_journals_2042801116 crossref_citationtrail_10_1007_s00453_017_0388_z crossref_primary_10_1007_s00453_017_0388_z springer_journals_10_1007_s00453_017_0388_z
PublicationCentury	2000
PublicationDate	2018-09-01
PublicationDateYYYYMMDD	2018-09-01
PublicationDate_xml	– month: 09 year: 2018 text: 2018-09-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Algorithmica
PublicationTitleAbbrev	Algorithmica
PublicationYear	2018
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Raman, Saurabh (CR35) 2007; 104 Edwards (CR12) 1973; 25 CR14 Raman, Saurabh (CR34) 2006; 351 CR36 CR13 CR33 CR10 Alon, Gutin, Kim, Szeider, Yeo (CR1) 2011; 61 Bollobás, Scott, Bollobás (CR3) 2002 Gutin, van Iersel, Mnich, Yeo (CR15) 2012; 78 Iwata, Wahlström, Yoshida (CR23) 2016; 45 Impagliazzo, Paturi, Zane (CR22) 2001; 63 Dvořák, Mnich (CR11) 2017; 31 Chiang, Kahng, Sinha, Xu, Zelikovsky (CR4) 2007; 26 Barahona (CR2) 1982; 15 Knuutila (CR25) 2001; 250 Crowston, Gutin, Jones, Muciaccia (CR7) 2013; 513 Poljak, Turzík (CR32) 1986; 58 Crowston, Fellows, Gutin, Jones, Kim, Rosamond, Ruzsa, Thomassé, Yeo (CR5) 2014; 80 CR6 Harary (CR18) 1955; 2 König (CR26) 1916; 77 CR28 CR9 CR27 Ngọc, Tuza (CR31) 1993; 2 CR24 Harary (CR19) 1959; 4 Gutin, Yeo (CR17) 2010; 110 Hüffner, Betzler, Niedermeier (CR21) 2010; 20 Mnich, Philip, Saurabh, Suchý (CR30) 2014; 80 Mahajan, Raman, Sikdar (CR29) 2009; 75 Harary, Lim, Wunsch (CR20) 2002; 13 Crowston, Jones, Mnich (CR8) 2015; 72 Gutin, Rafiey, Szeider, Yeo (CR16) 2007; 41 R Crowston (388_CR7) 2013; 513 R Impagliazzo (388_CR22) 2001; 63 M Mnich (388_CR30) 2014; 80 N Alon (388_CR1) 2011; 61 G Gutin (388_CR16) 2007; 41 B Bollobás (388_CR3) 2002 NV Ngọc (388_CR31) 1993; 2 C Chiang (388_CR4) 2007; 26 D König (388_CR26) 1916; 77 F Barahona (388_CR2) 1982; 15 F Harary (388_CR18) 1955; 2 G Gutin (388_CR17) 2010; 110 R Crowston (388_CR8) 2015; 72 T Knuutila (388_CR25) 2001; 250 388_CR24 V Raman (388_CR35) 2007; 104 S Poljak (388_CR32) 1986; 58 388_CR27 V Raman (388_CR34) 2006; 351 388_CR28 Z Dvořák (388_CR11) 2017; 31 M Mahajan (388_CR29) 2009; 75 F Harary (388_CR20) 2002; 13 388_CR9 F Harary (388_CR19) 1959; 4 388_CR6 G Gutin (388_CR15) 2012; 78 388_CR10 388_CR33 Y Iwata (388_CR23) 2016; 45 R Crowston (388_CR5) 2014; 80 CS Edwards (388_CR12) 1973; 25 388_CR14 388_CR36 388_CR13 F Hüffner (388_CR21) 2010; 20
References_xml	– volume: 110 start-page: 966 issue: 21 year: 2010 end-page: 969 ident: CR17 article-title: Note on maximal bisection above tight lower bound publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2010.08.001 – volume: 351 start-page: 446 issue: 3 year: 2006 end-page: 458 ident: CR34 article-title: Parameterized algorithms for feedback set problems and their duals in tournaments publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2005.10.010 – start-page: 185 year: 2002 end-page: 246 ident: CR3 article-title: Better bounds for max cut publication-title: Contemporary Combinatorics, Bolyai Society Mathematical Studies – volume: 75 start-page: 137 issue: 2 year: 2009 end-page: 153 ident: CR29 article-title: Parameterizing above or below guaranteed values publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2008.08.004 – ident: CR14 – volume: 104 start-page: 65 issue: 2 year: 2007 end-page: 72 ident: CR35 article-title: Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2007.05.014 – ident: CR10 – volume: 58 start-page: 99 issue: 1 year: 1986 end-page: 104 ident: CR32 article-title: A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound publication-title: Discrete Math. doi: 10.1016/0012-365X(86)90192-5 – volume: 20 start-page: 335 issue: 4 year: 2010 end-page: 360 ident: CR21 article-title: Separator-based data reduction for signed graph balancing publication-title: J. Comb. Optim. doi: 10.1007/s10878-009-9212-2 – ident: CR33 – volume: 15 start-page: 3241 issue: 10 year: 1982 end-page: 3253 ident: CR2 article-title: On the computational complexity of Ising spin glass models publication-title: J. Phys. A doi: 10.1088/0305-4470/15/10/028 – ident: CR6 – volume: 31 start-page: 1355 issue: 2 year: 2017 end-page: 1373 ident: CR11 article-title: Large independent sets in triangle-free planar graphs publication-title: SIAM J. Discrete Math. doi: 10.1137/16M1061862 – volume: 80 start-page: 1384 issue: 7 year: 2014 end-page: 1403 ident: CR30 article-title: Beyond Max-Cut: -extendible properties parameterized above the Poljak–Turzík bound publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2014.04.011 – volume: 25 start-page: 475 year: 1973 end-page: 485 ident: CR12 article-title: Some extremal properties of bipartite subgraphs publication-title: Can. J. Math. doi: 10.4153/CJM-1973-048-x – volume: 78 start-page: 151 issue: 1 year: 2012 end-page: 163 ident: CR15 article-title: Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2011.01.004 – volume: 63 start-page: 512 issue: 4 year: 2001 end-page: 530 ident: CR22 article-title: Which problems have strongly exponential complexity? publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.2001.1774 – volume: 41 start-page: 521 issue: 3 year: 2007 end-page: 538 ident: CR16 article-title: The linear arrangement problem parameterized above guaranteed value publication-title: Theory Comput. Syst. doi: 10.1007/s00224-007-1330-6 – volume: 72 start-page: 734 issue: 3 year: 2015 end-page: 757 ident: CR8 article-title: Max-cut parameterized above the Edwards–Erdős bound publication-title: Algorithmica doi: 10.1007/s00453-014-9870-z – volume: 2 start-page: 201 issue: 2 year: 1993 end-page: 210 ident: CR31 article-title: Linear-time approximation algorithms for the max cut problem publication-title: Comb. Probab. Comput. doi: 10.1017/S0963548300000596 – volume: 26 start-page: 115 issue: 1 year: 2007 end-page: 126 ident: CR4 article-title: Fast and efficient bright-field AAPSM conflict detection and correction publication-title: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. doi: 10.1109/TCAD.2006.882642 – volume: 513 start-page: 53 year: 2013 end-page: 64 ident: CR7 article-title: Maximum balanced subgraph problem parameterized above lower bound publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2013.10.026 – ident: CR27 – volume: 250 start-page: 333 issue: 1–2 year: 2001 end-page: 363 ident: CR25 article-title: Re-describing an algorithm by Hopcroft publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(99)00150-4 – volume: 2 start-page: 143 year: 1955 end-page: 146 ident: CR18 article-title: On the notion of balance of a signed graph (1953–54) publication-title: Mich. Math. J. – volume: 13 start-page: 201 issue: 3 year: 2002 end-page: 210 ident: CR20 article-title: Signed graphs for portfolio analysis in risk management publication-title: IMA J. Manag. Math. doi: 10.1093/imaman/13.3.201 – volume: 4 start-page: 316 year: 1959 end-page: 323 ident: CR19 article-title: On the measurement of structural balance publication-title: Behav. Sci. doi: 10.1002/bs.3830040405 – volume: 80 start-page: 687 issue: 4 year: 2014 end-page: 696 ident: CR5 article-title: Satisfying more than half of a system of linear equations over : a multivariate approach publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2013.10.002 – volume: 77 start-page: 453 issue: 4 year: 1916 end-page: 465 ident: CR26 article-title: Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre publication-title: Math. Ann. doi: 10.1007/BF01456961 – ident: CR13 – ident: CR9 – ident: CR36 – volume: 45 start-page: 1377 issue: 4 year: 2016 end-page: 1411 ident: CR23 article-title: Half-integrality, LP-branching, and FPT algorithms publication-title: SIAM J. Comput. doi: 10.1137/140962838 – ident: CR28 – ident: CR24 – volume: 61 start-page: 638 issue: 3 year: 2011 end-page: 655 ident: CR1 article-title: Solving MAX- -SAT above a tight lower bound publication-title: Algorithmica doi: 10.1007/s00453-010-9428-7 – volume: 80 start-page: 1384 issue: 7 year: 2014 ident: 388_CR30 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2014.04.011 – volume: 31 start-page: 1355 issue: 2 year: 2017 ident: 388_CR11 publication-title: SIAM J. Discrete Math. doi: 10.1137/16M1061862 – ident: 388_CR36 – ident: 388_CR33 doi: 10.1090/dimacs/020/04 – volume: 2 start-page: 143 year: 1955 ident: 388_CR18 publication-title: Mich. Math. J. – volume: 513 start-page: 53 year: 2013 ident: 388_CR7 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2013.10.026 – volume: 20 start-page: 335 issue: 4 year: 2010 ident: 388_CR21 publication-title: J. Comb. Optim. doi: 10.1007/s10878-009-9212-2 – volume: 45 start-page: 1377 issue: 4 year: 2016 ident: 388_CR23 publication-title: SIAM J. Comput. doi: 10.1137/140962838 – ident: 388_CR24 doi: 10.1007/978-1-4684-2001-2_9 – volume: 78 start-page: 151 issue: 1 year: 2012 ident: 388_CR15 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2011.01.004 – volume: 250 start-page: 333 issue: 1–2 year: 2001 ident: 388_CR25 publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(99)00150-4 – volume: 2 start-page: 201 issue: 2 year: 1993 ident: 388_CR31 publication-title: Comb. Probab. Comput. doi: 10.1017/S0963548300000596 – ident: 388_CR6 – volume: 58 start-page: 99 issue: 1 year: 1986 ident: 388_CR32 publication-title: Discrete Math. doi: 10.1016/0012-365X(86)90192-5 – ident: 388_CR13 – volume: 80 start-page: 687 issue: 4 year: 2014 ident: 388_CR5 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2013.10.002 – ident: 388_CR14 – volume: 72 start-page: 734 issue: 3 year: 2015 ident: 388_CR8 publication-title: Algorithmica doi: 10.1007/s00453-014-9870-z – volume: 13 start-page: 201 issue: 3 year: 2002 ident: 388_CR20 publication-title: IMA J. Manag. Math. doi: 10.1093/imaman/13.3.201 – volume: 351 start-page: 446 issue: 3 year: 2006 ident: 388_CR34 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2005.10.010 – start-page: 185 volume-title: Contemporary Combinatorics, Bolyai Society Mathematical Studies year: 2002 ident: 388_CR3 – volume: 26 start-page: 115 issue: 1 year: 2007 ident: 388_CR4 publication-title: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. doi: 10.1109/TCAD.2006.882642 – volume: 4 start-page: 316 year: 1959 ident: 388_CR19 publication-title: Behav. Sci. doi: 10.1002/bs.3830040405 – ident: 388_CR27 doi: 10.1007/978-3-662-47672-7_76 – ident: 388_CR28 – volume: 41 start-page: 521 issue: 3 year: 2007 ident: 388_CR16 publication-title: Theory Comput. Syst. doi: 10.1007/s00224-007-1330-6 – volume: 110 start-page: 966 issue: 21 year: 2010 ident: 388_CR17 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2010.08.001 – ident: 388_CR9 – volume: 63 start-page: 512 issue: 4 year: 2001 ident: 388_CR22 publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.2001.1774 – volume: 104 start-page: 65 issue: 2 year: 2007 ident: 388_CR35 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2007.05.014 – ident: 388_CR10 – volume: 77 start-page: 453 issue: 4 year: 1916 ident: 388_CR26 publication-title: Math. Ann. doi: 10.1007/BF01456961 – volume: 25 start-page: 475 year: 1973 ident: 388_CR12 publication-title: Can. J. Math. doi: 10.4153/CJM-1973-048-x – volume: 75 start-page: 137 issue: 2 year: 2009 ident: 388_CR29 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2008.08.004 – volume: 61 start-page: 638 issue: 3 year: 2011 ident: 388_CR1 publication-title: Algorithmica doi: 10.1007/s00453-010-9428-7 – volume: 15 start-page: 3241 issue: 10 year: 1982 ident: 388_CR2 publication-title: J. Phys. A doi: 10.1088/0305-4470/15/10/028
SSID	ssj0012796
Score	2.2750876
Snippet	The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	2574
SubjectTerms	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Informatics Kernels Lower bounds Mathematics of Computing Run time (computers) Special Issue dedicated to the 60th Birthday of Gregory Gutin Theory of Computation
Title	Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
URI	https://link.springer.com/article/10.1007/s00453-017-0388-z https://www.proquest.com/docview/2042801116
Volume	80
WOSCitedRecordID	wos000433025100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: Springer Nature Link Contemporary 1997-Present customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3LS8MwHA46PXhxPnE6JQdPSmBtHk1ujuEQlCG-2K0kbaKD2Unbedhfb9LXUFTQa5uG8ssv-b7we3wAnHqqFzOLs8hiL3dNtQ3iTEnEPU8bIgg1zBRiE8FoxMdjcVvVcWd1tnsdkixO6qbYzbEPl_sTINfBBC1WwZpFO-70Gu7un5rQgR8UolxOdh4Ri891KPO7KT6D0ZJhfgmKFlgzbP_rL7fAZkUtYb_0hW2wopMd0K5lG2C1i3fBhb1_Wv-G1zpNLDJCmcSwfIRcQQjsT59n6SR_ec2gZbRwOCkKX-CNyxmHg3me7YHH4eXD4ApVQgoowlTkSGAWCN94PR0xQj2JiYwDwrEKqOEyCiynkEIoaYivMI-wEsr4JuZSGKJ8Y_A-aCWzRB8AGLOYGkNiTg0hEZPCk3Z2TQnWwnID2gG92qJhVHUZd2IX07Dpj1xYKLQWCp2FwkUHnDWfvJUtNn4b3K2XKax2Wxb67uJnDyqPdcB5vSzL1z9Odvin0Udgw7IlXiaYdUErT-f6GKxH7_kkS08KJ_wAYcXVdA
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD7oFPTFecXp1Dz4pATWNmmTN8dwTDaH6JS9lfQSHcxO2s6H_XqT3oaigr62aSgnJ_m-cC4fwLnhtQJb4SxW2Mt0U22Jme0JzAwjlIQTKm2ZiU04wyEbj_ldUcedlNnuZUgyO6mrYjfNPnTuj4N1BxO8WIU1ogBLN8y_f3iqQgemk4lyadl5TBQ-l6HM76b4DEZLhvklKJphTbf-r7_chq2CWqJ27gs7sBJGu1AvZRtQsYv34ErdP5V_o34YRwoZkYgClD_CuiAEtafPs3iSvrwmSDFa1J1khS9ooHPGUWeeJvvw2L0edXq4EFLAvkV5irllO9yURiv0bUINYREROIRZnkMlE76jOIXg3BOSmJ7FfMvjnjRlwASXxDOltA6gFs2i8BBQYAdUShIwKgnxbcENoWYPKbFCrrgBbUCrtKjrF13GtdjF1K36I2cWcpWFXG0hd9GAi-qTt7zFxm-Dm-UyucVuS1xTX_zUQWXYDbgsl2X5-sfJjv40-gw2eqPbgTu4GfaPYVMxJ5YnmzWhlsbz8ATW_fd0ksSnmUN-AGwm2Fg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60inixPrFadQ-elMUm2Wx2b5ZqUFpKwQe9hc1jtVDT0qQe-uvdzasoKojXZHcIs7OZb5jHB3Bu-K2QKj-Lle9leqi2xIz6AjPDiCThxJZUZmQTTr_PhkM-KHhOk7LavUxJ5j0NekpTnF5NQ3lVNb5pJKLrgBysp5ngxSqsEV1Hr8P1h-cqjWA6GUGXpqDHRPnqMq35nYjPjmmJNr8kSDO_49b__cXbsFVATtTObWQHVqJ4F-olnQMqbvceXKu4VNk96kazWHlMJOIQ5Y-wbhRB7fHLZDZKX98SpJAuckdZQwzq6Vpy1JmnyT48ubePnTtcECzgwLJ5irlFHW5KoxUFlNiGsIgIHcIs37ElE4GjsIbg3BeSmL7FAsvnvjRlyASXxDeltA6gFk_i6BBQSENbShIyWxISUMENoaRHNrEirjCD3YBWqV0vKKaPaxKMsVfNTc405CkNeVpD3qIBF9WWaT5647fFzfLIvOIWJp6pA0L1AzNoAy7LI1q-_lHY0Z9Wn8HG4Mb1evf97jFsKkDF8hq0JtTS2Tw6gfXgPR0ls9PMNj8ACMLhPA
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=Linear+Kernels+and+Linear-Time+Algorithms+for+Finding+Large+Cuts&rft.jtitle=Algorithmica&rft.au=Etscheid%2C+Michael&rft.au=Mnich%2C+Matthias&rft.date=2018-09-01&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=80&rft.issue=9&rft.spage=2574&rft.epage=2615&rft_id=info:doi/10.1007%2Fs00453-017-0388-z&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00453_017_0388_z
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon