Parameterized Complexity of the Spanning Tree Congestion Problem
We study the problem of determining the spanning tree congestion of a graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-free graphs, a general class of graphs containing planar graphs, graphs of bounded treewidth, and graphs of...
Saved in:
| Published in: | Algorithmica Vol. 64; no. 1; pp. 85 - 111 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer-Verlag
01.09.2012
|
| Subjects: | |
| ISSN: | 0178-4617, 1432-0541 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We study the problem of determining the
spanning tree congestion
of a graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-free graphs, a general class of graphs containing planar graphs, graphs of bounded treewidth, and graphs of bounded genus, the problem to determine whether a given graph has spanning tree congestion at most
k
can be solved in linear time for every fixed
k
. We also show that for every fixed
k
and
d
the problem is solvable in linear time for graphs of degree at most
d
. In contrast, if we allow only one vertex of unbounded degree, the problem immediately becomes NP-complete for any fixed
k
≥8. Moreover, the hardness result holds for graphs excluding the complete graph on 6 vertices as a minor. We also observe that for
k
≤3 the problem becomes polynomially time solvable. |
|---|---|
| AbstractList | We study the problem of determining the
spanning tree congestion
of a graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-free graphs, a general class of graphs containing planar graphs, graphs of bounded treewidth, and graphs of bounded genus, the problem to determine whether a given graph has spanning tree congestion at most
k
can be solved in linear time for every fixed
k
. We also show that for every fixed
k
and
d
the problem is solvable in linear time for graphs of degree at most
d
. In contrast, if we allow only one vertex of unbounded degree, the problem immediately becomes NP-complete for any fixed
k
≥8. Moreover, the hardness result holds for graphs excluding the complete graph on 6 vertices as a minor. We also observe that for
k
≤3 the problem becomes polynomially time solvable. |
| Author | van Leeuwen, Erik Jan Fomin, Fedor V. Bodlaender, Hans L. Golovach, Petr A. Otachi, Yota |
| Author_xml | – sequence: 1 givenname: Hans L. surname: Bodlaender fullname: Bodlaender, Hans L. organization: Department of Information and Computing Sciences, Utrecht University – sequence: 2 givenname: Fedor V. surname: Fomin fullname: Fomin, Fedor V. email: fomin@ii.uib.no organization: Department of Informatics, University of Bergen – sequence: 3 givenname: Petr A. surname: Golovach fullname: Golovach, Petr A. organization: School of Engineering and Computing Sciences, Durham University – sequence: 4 givenname: Yota surname: Otachi fullname: Otachi, Yota organization: Graduate School of Information Sciences, Tohoku University – sequence: 5 givenname: Erik Jan surname: van Leeuwen fullname: van Leeuwen, Erik Jan organization: Department of Informatics, University of Bergen |
| BookMark | eNp9kMFKAzEQhoNUsK0-gLd9gegku0l2b0pRKxQsWM8hm52tW3aTkqxgfXpT6slDTzMw8w3zfzMycd4hIbcM7hiAuo8AhcgpMEYrIQVVF2TKipxTEAWbkCkwVdJCMnVFZjHuABhXlZySh7UJZsARQ_eDTbbww77H7248ZL7Nxk_M3vfGuc5ts01ATHO3xTh23mXr4Oseh2ty2Zo-4s1fnZOP56fNYklXby-vi8cVtXmlRspq5E3JbVFXDajS2EYK2ajayJpXpc0tSpb6kkslqxYADQewVSG4aUSrbD4n6nTXBh9jwFbbbjTHT8Zgul4z0EcR-iRCJxH6KEKrRLJ_5D50gwmHsww_MTHtpshB7_xXcCngGegXj0xyog |
| CitedBy_id | crossref_primary_10_1016_j_dam_2025_06_054 crossref_primary_10_1016_j_amc_2020_125502 crossref_primary_10_1007_s10255_021_1028_6 crossref_primary_10_1007_s40305_022_00419_3 crossref_primary_10_1016_j_tcs_2018_02_025 crossref_primary_10_1007_s00453_024_01278_5 |
| Cites_doi | 10.1137/S0895480192237403 10.1137/S0895480103433410 10.1016/j.ejc.2003.07.007 10.1016/j.disc.2008.12.021 10.1016/S0095-8956(03)00042-X 10.1109/SFCS.2005.14 10.4153/CJM-1992-076-8 10.1016/j.disc.2009.11.016 10.1007/BF01758777 10.1007/BF01692067 10.1006/jctb.1997.1761 10.1137/S0097539792225297 10.1145/321850.321852 10.1016/j.jctb.2008.06.004 10.1016/S0304-3975(03)00424-9 10.1016/0095-8956(91)90061-N 10.1007/s00453-006-1209-y 10.1016/j.disc.2009.01.012 10.1007/3-540-45687-2_5 10.7151/dmgt.1461 10.1137/S0097539793251219 10.1145/1101821.1101823 10.1007/s004530010020 10.1016/j.disc.2009.07.007 10.1007/978-1-4612-0515-9 10.1016/j.ipl.2010.10.021 10.1016/0166-218X(94)90143-0 10.1007/s00493-008-2140-4 10.1016/j.tcs.2010.11.034 10.1016/j.disc.2007.04.030 10.1006/jctb.1994.1073 10.1016/S0166-218X(00)00226-2 10.1007/s00493-003-0037-9 10.1137/0211025 10.1016/j.disc.2004.02.009 10.1007/978-3-642-20877-5_44 10.1016/j.jcss.2010.10.002 10.4064/fm-28-1-22-32 10.1051/ita/1992260302571 10.1007/978-3-642-16926-7_3 10.1007/978-3-642-02927-1_27 10.56021/9780801866890 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2011 |
| Copyright_xml | – notice: The Author(s) 2011 |
| DBID | C6C AAYXX CITATION |
| DOI | 10.1007/s00453-011-9565-7 |
| DatabaseName | Springer Nature OA Free Journals CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1432-0541 |
| EndPage | 111 |
| ExternalDocumentID | 10_1007_s00453_011_9565_7 |
| 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 |
| ID | FETCH-LOGICAL-c397t-1be2d82c4b9d078acd656d7ba6b298c3ce61a6b826769f00ea200c9452ad5f7c3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000304395100007&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 | Sat Nov 29 03:45:24 EST 2025 Tue Nov 18 22:35:45 EST 2025 Fri Feb 21 02:43:09 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Parameterized algorithms Graph minor Apex graph Spanning tree congestion |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c397t-1be2d82c4b9d078acd656d7ba6b298c3ce61a6b826769f00ea200c9452ad5f7c3 |
| OpenAccessLink | https://link.springer.com/10.1007/s00453-011-9565-7 |
| PageCount | 27 |
| ParticipantIDs | crossref_citationtrail_10_1007_s00453_011_9565_7 crossref_primary_10_1007_s00453_011_9565_7 springer_journals_10_1007_s00453_011_9565_7 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-09-01 |
| PublicationDateYYYYMMDD | 2012-09-01 |
| PublicationDate_xml | – month: 09 year: 2012 text: 2012-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Algorithmica |
| PublicationTitleAbbrev | Algorithmica |
| PublicationYear | 2012 |
| Publisher | Springer-Verlag |
| Publisher_xml | – name: Springer-Verlag |
| References | Downey, Fellows (CR19) 1999 Kozawa, Otachi, Yamazaki (CR28) 2009; 309 MacLane (CR34) 1937; 28 Kratochvíl (CR29) 1994; 52 Demaine, Hajiaghayi, Kawarabayashi (CR15) 2009 Grohe (CR24) 2003; 23 Castejón, Ostrovskii (CR6) 2009; 29 Demaine, Fomin, Hajiaghayi, Thilikos (CR10) 2005; 52 CR17 Eppstein (CR20) 2000; 27 Otachi, Bodlaender, van Leeuwen (CR40) 2010 Dragan, Fomin, Golovach (CR18) 2011; 412 Fomin, Golovach, van Leeuwen (CR22) 2011; 111 Thomassen (CR47) 1997; 70 Robertson, Seymour (CR44) 2003; 89 Okamoto, Otachi, Uehara, Uno (CR37) 2011 Law (CR30) 2009; 309 Courcelle (CR8) 1992; 26 Geelen, Richter, Salazar (CR23) 2004; 25 Borie, Parker, Tovey (CR2) 1992; 7 Simonson (CR46) 1987; 20 Demaine, Hajiaghayi (CR12) 2005 Brandstädt, Dragan, Le, Le, Uehara (CR4) 2007; 47 Löwenstein, Rautenbach, Regen (CR33) 2009; 309 Robertson, Seymour (CR43) 1991; 52 Hopcroft, Tarjan (CR26) 1974; 21 Mohar (CR35) 1992; 44 Grohe, Marx (CR25) 2009; 99 Raspaud, Sýkora, Vrťo (CR42) 2000 Demaine, Hajiaghayi, Kawarabayashi (CR14) 2005 Cormen, Leiserson, Rivest, Stein (CR7) 2009 Dahlhaus, Johnson, Papadimitriou, Seymour, Yannakakis (CR9) 1994; 23 Mohar, Thomassen (CR36) 2001 Demaine, Hajiaghayi (CR13) 2008; 28 Ostrovskii (CR38) 2004; 285 Cai, Corneil (CR5) 1995; 8 Demaine, Fomin, Hajiaghayi, Thilikos (CR11) 2004; 18 Diestel (CR16) 2005 Hruska (CR27) 2008; 308 Bodlaender (CR1) 1996; 25 Peleg (CR41) 2002 Fekete, Kremer (CR21) 2001; 108 Lawler (CR31) 1976 Robertson, Seymour, Thomas (CR45) 1994; 62 Lichtenstein (CR32) 1982; 11 Brandstädt, Dragan, Le, Le (CR3) 2004; 310 Ostrovskii (CR39) 2010; 310 M. Grohe (9565_CR24) 2003; 23 J.F. Geelen (9565_CR23) 2004; 25 A. Brandstädt (9565_CR3) 2004; 310 E.D. Demaine (9565_CR10) 2005; 52 E.D. Demaine (9565_CR11) 2004; 18 B. Courcelle (9565_CR8) 1992; 26 E.D. Demaine (9565_CR14) 2005 H.-F. Law (9565_CR30) 2009; 309 9565_CR17 J. Kratochvíl (9565_CR29) 1994; 52 C. Thomassen (9565_CR47) 1997; 70 F.F. Dragan (9565_CR18) 2011; 412 M.I. Ostrovskii (9565_CR39) 2010; 310 N. Robertson (9565_CR45) 1994; 62 A. Brandstädt (9565_CR4) 2007; 47 R.G. Downey (9565_CR19) 1999 S. MacLane (9565_CR34) 1937; 28 D. Lichtenstein (9565_CR32) 1982; 11 T. Cormen (9565_CR7) 2009 J. Hopcroft (9565_CR26) 1974; 21 F.V. Fomin (9565_CR22) 2011; 111 D. Eppstein (9565_CR20) 2000; 27 N. Robertson (9565_CR43) 1991; 52 E.D. Demaine (9565_CR15) 2009 B. Mohar (9565_CR35) 1992; 44 E. Lawler (9565_CR31) 1976 N. Robertson (9565_CR44) 2003; 89 D. Peleg (9565_CR41) 2002 S.W. Hruska (9565_CR27) 2008; 308 Y. Okamoto (9565_CR37) 2011 R.B. Borie (9565_CR2) 1992; 7 M. Grohe (9565_CR25) 2009; 99 A. Castejón (9565_CR6) 2009; 29 E.D. Demaine (9565_CR13) 2008; 28 A. Raspaud (9565_CR42) 2000 E. Dahlhaus (9565_CR9) 1994; 23 H.L. Bodlaender (9565_CR1) 1996; 25 E.D. Demaine (9565_CR12) 2005 M.I. Ostrovskii (9565_CR38) 2004; 285 S.P. Fekete (9565_CR21) 2001; 108 R. Diestel (9565_CR16) 2005 K. Kozawa (9565_CR28) 2009; 309 B. Mohar (9565_CR36) 2001 C. Löwenstein (9565_CR33) 2009; 309 Y. Otachi (9565_CR40) 2010 L. Cai (9565_CR5) 1995; 8 S. Simonson (9565_CR46) 1987; 20 |
| References_xml | – volume: 8 start-page: 359 year: 1995 end-page: 387 ident: CR5 article-title: Tree spanners publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480192237403 – year: 2009 ident: CR7 publication-title: Introduction to Algorithms – volume: 18 start-page: 501 issue: 3 year: 2004 end-page: 511 ident: CR11 article-title: Bidimensional parameters and local treewidth publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480103433410 – volume: 25 start-page: 785 year: 2004 end-page: 792 ident: CR23 article-title: Embedding grids in surfaces publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2003.07.007 – volume: 309 start-page: 4215 year: 2009 end-page: 4224 ident: CR28 article-title: On spanning tree congestion of graphs publication-title: Discrete Math. doi: 10.1016/j.disc.2008.12.021 – volume: 89 start-page: 43 year: 2003 end-page: 76 ident: CR44 article-title: Graph minors. XVI. Excluding a non-planar graph publication-title: J. Comb. Theory, Ser. B doi: 10.1016/S0095-8956(03)00042-X – start-page: 637 year: 2005 end-page: 646 ident: CR14 article-title: Algorithmic graph minor theory: Decomposition, approximation, and coloring publication-title: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005) doi: 10.1109/SFCS.2005.14 – volume: 44 start-page: 1272 year: 1992 end-page: 1288 ident: CR35 article-title: Combinatorial local planarity and the width of graph embeddings publication-title: Can. J. Math. doi: 10.4153/CJM-1992-076-8 – year: 2001 ident: CR36 publication-title: Graphs on Surfaces – volume: 310 start-page: 1204 year: 2010 end-page: 1209 ident: CR39 article-title: Minimum congestion spanning trees in planar graphs publication-title: Discrete Math. doi: 10.1016/j.disc.2009.11.016 – volume: 7 start-page: 555 year: 1992 end-page: 581 ident: CR2 article-title: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families publication-title: Algorithmica doi: 10.1007/BF01758777 – start-page: 3 year: 2010 end-page: 14 ident: CR40 article-title: Complexity results for the spanning tree congestion problem publication-title: Proceedings of the 6th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2010) – volume: 20 start-page: 235 year: 1987 end-page: 252 ident: CR46 article-title: A variation on the min cut linear arrangement problem publication-title: Math. Syst. Theory doi: 10.1007/BF01692067 – volume: 70 start-page: 306 year: 1997 end-page: 311 ident: CR47 article-title: A simpler proof of the excluded minor theorem for higher surfaces publication-title: J. Comb. Theory, Ser. B doi: 10.1006/jctb.1997.1761 – volume: 23 start-page: 864 year: 1994 end-page: 894 ident: CR9 article-title: The complexity of multiterminal cuts publication-title: SIAM J. Comput. doi: 10.1137/S0097539792225297 – volume: 21 start-page: 549 year: 1974 end-page: 568 ident: CR26 article-title: Efficient planarity testing publication-title: J. ACM doi: 10.1145/321850.321852 – volume: 99 start-page: 218 year: 2009 end-page: 228 ident: CR25 article-title: On tree width, bramble size, and expansion publication-title: J. Comb. Theory, Ser. B doi: 10.1016/j.jctb.2008.06.004 – volume: 28 start-page: 22 year: 1937 end-page: 32 ident: CR34 article-title: A combinatorial condition for planar graphs publication-title: Fundam. Math. – volume: 310 start-page: 329 year: 2004 end-page: 354 ident: CR3 article-title: Tree spanners on chordal graphs: complexity and algorithms publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(03)00424-9 – year: 1976 ident: CR31 publication-title: Combinatorial Optimization: Networks and Matroids – volume: 52 start-page: 153 year: 1991 end-page: 190 ident: CR43 article-title: Graph minors. X. Obstructions to tree-decomposition publication-title: J. Comb. Theory, Ser. B doi: 10.1016/0095-8956(91)90061-N – start-page: 269 year: 2000 end-page: 280 ident: CR42 article-title: Congestion and dilation, similarities and differences: a survey publication-title: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2000) – volume: 47 start-page: 27 year: 2007 end-page: 51 ident: CR4 article-title: Tree spanners for bipartite graphs and probe interval graphs publication-title: Algorithmica doi: 10.1007/s00453-006-1209-y – volume: 26 start-page: 257 year: 1992 end-page: 286 ident: CR8 article-title: The monadic second-order logic of graphs III: Tree-decompositions, minor and complexity issues publication-title: Theor. Inform. Appl. – volume: 309 start-page: 4653 year: 2009 end-page: 4655 ident: CR33 article-title: On spanning tree congestion publication-title: Discrete Math. doi: 10.1016/j.disc.2009.01.012 – start-page: 68 year: 2002 end-page: 80 ident: CR41 article-title: Low stretch spanning trees publication-title: Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002) doi: 10.1007/3-540-45687-2_5 – volume: 29 start-page: 511 year: 2009 end-page: 519 ident: CR6 article-title: Minimum congestion spanning trees of grids and discrete toruses publication-title: Discuss. Math., Graph Theory doi: 10.7151/dmgt.1461 – volume: 25 start-page: 1305 year: 1996 end-page: 1317 ident: CR1 article-title: A linear-time algorithm for finding tree-decompositions of small treewidth publication-title: SIAM J. Comput. doi: 10.1137/S0097539793251219 – start-page: 452 year: 2011 end-page: 462 ident: CR37 article-title: Hardness results and an exact exponential algorithm for the spanning tree congestion problem publication-title: Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011) – year: 2005 ident: CR16 publication-title: Graph Theory – ident: CR17 – volume: 52 start-page: 866 year: 2005 end-page: 893 ident: CR10 article-title: Subexponential parameterized algorithms on graphs of bounded genus and -minor-free graphs publication-title: J. ACM doi: 10.1145/1101821.1101823 – volume: 27 start-page: 275 year: 2000 end-page: 291 ident: CR20 article-title: Diameter and treewidth in minor-closed graph families publication-title: Algorithmica doi: 10.1007/s004530010020 – volume: 309 start-page: 6644 year: 2009 end-page: 6648 ident: CR30 article-title: Spanning tree congestion of the hypercube publication-title: Discrete Math. doi: 10.1016/j.disc.2009.07.007 – year: 1999 ident: CR19 publication-title: Parameterized Complexity doi: 10.1007/978-1-4612-0515-9 – volume: 111 start-page: 142 year: 2011 end-page: 144 ident: CR22 article-title: Spanners of bounded degree graphs publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2010.10.021 – volume: 52 start-page: 233 year: 1994 end-page: 252 ident: CR29 article-title: A special planar satisfiability problem and a consequence of its NP-completeness publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(94)90143-0 – volume: 28 start-page: 19 year: 2008 end-page: 36 ident: CR13 article-title: Linearity of grid minors in treewidth with applications through bidimensionality publication-title: Combinatorica doi: 10.1007/s00493-008-2140-4 – volume: 412 start-page: 846 year: 2011 end-page: 852 ident: CR18 article-title: Approximation of minimum weight spanners for sparse graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.11.034 – start-page: 682 year: 2005 end-page: 689 ident: CR12 article-title: Graphs excluding a fixed minor have grids as large as treewidth,with combinatorial and algorithmic applications through bidimensionality publication-title: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005) – volume: 308 start-page: 1801 year: 2008 end-page: 1809 ident: CR27 article-title: On tree congestion of graphs publication-title: Discrete Math. doi: 10.1016/j.disc.2007.04.030 – volume: 62 start-page: 323 year: 1994 end-page: 348 ident: CR45 article-title: Quickly excluding a planar graph publication-title: J. Comb. Theory, Ser. B doi: 10.1006/jctb.1994.1073 – volume: 108 start-page: 85 year: 2001 end-page: 103 ident: CR21 article-title: Tree spanners in planar graphs publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(00)00226-2 – volume: 23 start-page: 613 year: 2003 end-page: 632 ident: CR24 article-title: Local tree-width, excluded minors, and approximation algorithms publication-title: Combinatorica doi: 10.1007/s00493-003-0037-9 – volume: 11 start-page: 329 year: 1982 end-page: 343 ident: CR32 article-title: Planar formulae and their uses publication-title: SIAM J. Comput. doi: 10.1137/0211025 – start-page: 316 year: 2009 end-page: 327 ident: CR15 article-title: Approximation algorithms via structural results for apex-minor-free graphs publication-title: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009) – volume: 285 start-page: 219 year: 2004 end-page: 226 ident: CR38 article-title: Minimal congestion trees publication-title: Discrete Math. doi: 10.1016/j.disc.2004.02.009 – volume: 111 start-page: 142 year: 2011 ident: 9565_CR22 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2010.10.021 – volume-title: Combinatorial Optimization: Networks and Matroids year: 1976 ident: 9565_CR31 – start-page: 452 volume-title: Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011) year: 2011 ident: 9565_CR37 doi: 10.1007/978-3-642-20877-5_44 – ident: 9565_CR17 doi: 10.1016/j.jcss.2010.10.002 – volume: 309 start-page: 4653 year: 2009 ident: 9565_CR33 publication-title: Discrete Math. doi: 10.1016/j.disc.2009.01.012 – volume: 29 start-page: 511 year: 2009 ident: 9565_CR6 publication-title: Discuss. Math., Graph Theory doi: 10.7151/dmgt.1461 – volume: 23 start-page: 864 year: 1994 ident: 9565_CR9 publication-title: SIAM J. Comput. doi: 10.1137/S0097539792225297 – volume: 52 start-page: 866 year: 2005 ident: 9565_CR10 publication-title: J. ACM doi: 10.1145/1101821.1101823 – volume: 7 start-page: 555 year: 1992 ident: 9565_CR2 publication-title: Algorithmica doi: 10.1007/BF01758777 – volume: 44 start-page: 1272 year: 1992 ident: 9565_CR35 publication-title: Can. J. Math. doi: 10.4153/CJM-1992-076-8 – volume-title: Graph Theory year: 2005 ident: 9565_CR16 – volume: 52 start-page: 233 year: 1994 ident: 9565_CR29 publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(94)90143-0 – volume: 18 start-page: 501 issue: 3 year: 2004 ident: 9565_CR11 publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480103433410 – volume: 309 start-page: 4215 year: 2009 ident: 9565_CR28 publication-title: Discrete Math. doi: 10.1016/j.disc.2008.12.021 – volume: 11 start-page: 329 year: 1982 ident: 9565_CR32 publication-title: SIAM J. Comput. doi: 10.1137/0211025 – volume: 28 start-page: 19 year: 2008 ident: 9565_CR13 publication-title: Combinatorica doi: 10.1007/s00493-008-2140-4 – volume: 412 start-page: 846 year: 2011 ident: 9565_CR18 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.11.034 – volume: 99 start-page: 218 year: 2009 ident: 9565_CR25 publication-title: J. Comb. Theory, Ser. B doi: 10.1016/j.jctb.2008.06.004 – volume: 28 start-page: 22 year: 1937 ident: 9565_CR34 publication-title: Fundam. Math. doi: 10.4064/fm-28-1-22-32 – volume: 285 start-page: 219 year: 2004 ident: 9565_CR38 publication-title: Discrete Math. doi: 10.1016/j.disc.2004.02.009 – volume: 20 start-page: 235 year: 1987 ident: 9565_CR46 publication-title: Math. Syst. Theory doi: 10.1007/BF01692067 – volume: 47 start-page: 27 year: 2007 ident: 9565_CR4 publication-title: Algorithmica doi: 10.1007/s00453-006-1209-y – volume: 309 start-page: 6644 year: 2009 ident: 9565_CR30 publication-title: Discrete Math. doi: 10.1016/j.disc.2009.07.007 – volume: 26 start-page: 257 year: 1992 ident: 9565_CR8 publication-title: Theor. Inform. Appl. doi: 10.1051/ita/1992260302571 – start-page: 3 volume-title: Proceedings of the 6th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2010) year: 2010 ident: 9565_CR40 doi: 10.1007/978-3-642-16926-7_3 – volume: 23 start-page: 613 year: 2003 ident: 9565_CR24 publication-title: Combinatorica doi: 10.1007/s00493-003-0037-9 – volume: 25 start-page: 1305 year: 1996 ident: 9565_CR1 publication-title: SIAM J. Comput. doi: 10.1137/S0097539793251219 – start-page: 316 volume-title: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009) year: 2009 ident: 9565_CR15 doi: 10.1007/978-3-642-02927-1_27 – volume: 21 start-page: 549 year: 1974 ident: 9565_CR26 publication-title: J. ACM doi: 10.1145/321850.321852 – start-page: 68 volume-title: Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002) year: 2002 ident: 9565_CR41 doi: 10.1007/3-540-45687-2_5 – volume: 27 start-page: 275 year: 2000 ident: 9565_CR20 publication-title: Algorithmica doi: 10.1007/s004530010020 – start-page: 269 volume-title: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2000) year: 2000 ident: 9565_CR42 – volume: 89 start-page: 43 year: 2003 ident: 9565_CR44 publication-title: J. Comb. Theory, Ser. B doi: 10.1016/S0095-8956(03)00042-X – volume-title: Parameterized Complexity year: 1999 ident: 9565_CR19 doi: 10.1007/978-1-4612-0515-9 – volume: 25 start-page: 785 year: 2004 ident: 9565_CR23 publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2003.07.007 – volume: 8 start-page: 359 year: 1995 ident: 9565_CR5 publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480192237403 – volume: 108 start-page: 85 year: 2001 ident: 9565_CR21 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(00)00226-2 – volume: 52 start-page: 153 year: 1991 ident: 9565_CR43 publication-title: J. Comb. Theory, Ser. B doi: 10.1016/0095-8956(91)90061-N – volume: 310 start-page: 1204 year: 2010 ident: 9565_CR39 publication-title: Discrete Math. doi: 10.1016/j.disc.2009.11.016 – volume: 70 start-page: 306 year: 1997 ident: 9565_CR47 publication-title: J. Comb. Theory, Ser. B doi: 10.1006/jctb.1997.1761 – volume: 310 start-page: 329 year: 2004 ident: 9565_CR3 publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(03)00424-9 – start-page: 682 volume-title: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005) year: 2005 ident: 9565_CR12 – volume-title: Graphs on Surfaces year: 2001 ident: 9565_CR36 doi: 10.56021/9780801866890 – volume-title: Introduction to Algorithms year: 2009 ident: 9565_CR7 – start-page: 637 volume-title: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005) year: 2005 ident: 9565_CR14 doi: 10.1109/SFCS.2005.14 – volume: 62 start-page: 323 year: 1994 ident: 9565_CR45 publication-title: J. Comb. Theory, Ser. B doi: 10.1006/jctb.1994.1073 – volume: 308 start-page: 1801 year: 2008 ident: 9565_CR27 publication-title: Discrete Math. doi: 10.1016/j.disc.2007.04.030 |
| SSID | ssj0012796 |
| Score | 2.061263 |
| Snippet | We study the problem of determining the
spanning tree congestion
of a graph. We present some sharp contrasts in the parameterized complexity of this problem.... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 85 |
| SubjectTerms | Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation |
| Title | Parameterized Complexity of the Spanning Tree Congestion Problem |
| URI | https://link.springer.com/article/10.1007/s00453-011-9565-7 |
| Volume | 64 |
| WOSCitedRecordID | wos000304395100007&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: SpringerLINK 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/eLvHCXMwnV1LS8NAEB60evBifWJ9sQdPykKy3c12b4pYPJVCq_QW9hUQJC1tFPTXO5sXFFTQWyCTECY7O98yM98HcBXFWayziFPDEb5xbwQ1iVA0TrwTjiW4A-pSbEKORoPZTI3rOe5V0-3elCTLnboddgvoI_T-xBQxvaByE7ZEIJsJR_TJc1s6YLIU5Qqy85Rjfm5Kmd-9Yj0ZrVdCywQz7P7r0_Zgt8aT5K5aAPuw4fMD6DZaDaQO3UO4HevQhhWYmT-9I8EgUGEWH2SeEQSBZLKo1IvIdOk93s9D4Ql_GhlXkjNH8DR8mN4_0lo9gVrEGAWNjWduwCw3yiEO0NYhdHPS6MQwNbB965MYr_F4IROVRZHXGDBWccG0E5m0_WPo5PPcnwBxzNrIMc85M1wyr7jKZBjRNXi-MU70IGrcmNqaWjwoXLymLSly6aEUPZQGD6WyB9ftI4uKV-M345vG72kdYqufrU__ZH0GO4iBWNU2dg6dYvnmL2Dbvhcvq-VlubS-AFT1x0M |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60CnqxPrE-9-BJWUi2m2z3poilYi2FVuktZB8BQdLSRkF_vbN5QUEFvQV2soTJzs43zOMDuPD8xI8Tj1PFEb5xqwKqwkBSP7QmMCzEGzDOySbEYNCZTOSw7ONeVNXuVUoyv6nrZjeHPlztj08R0wdUrMIadyw7LkQfPdepAyZyUi5HO085-ucqlfndFsvOaDkTmjuYbvNfn7YNWyWeJDfFAdiBFZvuQrPiaiCl6e7B9TB2ZVhuMvOnNcQJuFGY2QeZJgRBIBnNCvYiMp5bi-upSzzhTyPDgnJmH566d-PbHi3ZE6hGjJFRX1lmOkxzJQ3igFgbhG5GqDhUTHZ0W9vQx2cML0QoE8-zMRqMljxgsQkSodsH0EinqT0EYpjWnmGWc6a4YFZymQjXoqswvlEmaIFXqTHS5Whxx3DxGtVDkXMNRaihyGkoEi24rF-ZFXM1fhO-qvQelSa2-Fn66E_S57DRGz_2o_794OEYNhEPsaKE7AQa2fzNnsK6fs9eFvOz_Jh9AbY_yic |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60injxLdbnHjwpS5PtJtu9KWpRlBJsld5C9hEQJC1tFPTXO5tHoaCCeAtkEsLsTuZbZub7AE49P_WT1ONUcYRv3KqAqjCQ1A-tCQwL8Q-YFGITotfrDIcyqnROp3W3e12SLGcaHEtTlrfGJm3NBt8cEnF9QD5FfB9QsQhLHA8yrqfrsf88KyMwUQh0OQl6yjFX12XN714xn5jmq6JFsumu__szN2CtwpnkstwYm7Bgsy1YrzUcSBXS23ARJa49yzE2f1pDnIGjyMw_yCglCA5Jf1yqGpHBxFq8n7mCFC4miUopmh146t4Mrm5ppapANWKPnPrKMtNhmitp0GOJNgjpjFBJqJjs6La2oY_XeOwQoUw9zyYYSFrygCUmSIVu70IjG2V2D4hhWnuGWc6Z4oJZyWUq3OiuwnOPMkETvNqlsa4ox53yxWs8I0suPBSjh2LnoVg04Wz2yLjk2_jN-Lxeg7gKvenP1vt_sj6Blei6Gz_c9e4PYBVhEis7yw6hkU_e7BEs6_f8ZTo5LnbcF-U90ws |
| 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=Parameterized+Complexity+of+the+Spanning+Tree+Congestion+Problem&rft.jtitle=Algorithmica&rft.au=Bodlaender%2C+Hans+L.&rft.au=Fomin%2C+Fedor+V.&rft.au=Golovach%2C+Petr+A.&rft.au=Otachi%2C+Yota&rft.date=2012-09-01&rft.pub=Springer-Verlag&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=64&rft.issue=1&rft.spage=85&rft.epage=111&rft_id=info:doi/10.1007%2Fs00453-011-9565-7&rft.externalDocID=10_1007_s00453_011_9565_7 |
| 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 |