The Curse of Connectivity: t -Total Vertex (Edge) Cover
Identifieur interne : 001105 ( Istex/Corpus ); précédent : 001104; suivant : 001106The Curse of Connectivity: t -Total Vertex (Edge) Cover
Auteurs : Henning Fernau ; Fedor V. Fomin ; Geevarghese Philip ; Saket SaurabhSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Url:
DOI: 10.1007/978-3-642-14031-0_6
Links to Exploration step
ISTEX:CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AFLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Curse of Connectivity: t -Total Vertex (Edge) Cover</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><mods:affiliation>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fernau@uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Fomin, Fedor V" sort="Fomin, Fedor V" uniqKey="Fomin F" first="Fedor V." last="Fomin">Fedor V. Fomin</name><affiliation><mods:affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fomin@ii.uib.no</mods:affiliation></affiliation></author><author><name sortKey="Philip, Geevarghese" sort="Philip, Geevarghese" uniqKey="Philip G" first="Geevarghese" last="Philip">Geevarghese Philip</name><affiliation><mods:affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: gphilip@imsc.res.in</mods:affiliation></affiliation></author><author><name sortKey="Saurabh, Saket" sort="Saurabh, Saket" uniqKey="Saurabh S" first="Saket" last="Saurabh">Saket Saurabh</name><affiliation><mods:affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: saket@imsc.res.in</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-14031-0_6</idno><idno type="url">https://api.istex.fr/document/CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001105</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001105</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Curse of Connectivity: t -Total Vertex (Edge) Cover</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><mods:affiliation>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fernau@uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Fomin, Fedor V" sort="Fomin, Fedor V" uniqKey="Fomin F" first="Fedor V." last="Fomin">Fedor V. Fomin</name><affiliation><mods:affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fomin@ii.uib.no</mods:affiliation></affiliation></author><author><name sortKey="Philip, Geevarghese" sort="Philip, Geevarghese" uniqKey="Philip G" first="Geevarghese" last="Philip">Geevarghese Philip</name><affiliation><mods:affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: gphilip@imsc.res.in</mods:affiliation></affiliation></author><author><name sortKey="Saurabh, Saket" sort="Saurabh, Saket" uniqKey="Saurabh S" first="Saket" last="Saurabh">Saket Saurabh</name><affiliation><mods:affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: saket@imsc.res.in</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF</idno><idno type="DOI">10.1007/978-3-642-14031-0_6</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Henning Fernau</name><affiliations><json:string>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</json:string><json:string>E-mail: fernau@uni-trier.de</json:string></affiliations></json:item><json:item><name>Fedor V. Fomin</name><affiliations><json:string>Department of Informatics, University of Bergen, 5020, Bergen, Norway</json:string><json:string>E-mail: fomin@ii.uib.no</json:string></affiliations></json:item><json:item><name>Geevarghese Philip</name><affiliations><json:string>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</json:string><json:string>E-mail: gphilip@imsc.res.in</json:string></affiliations></json:item><json:item><name>Saket Saurabh</name><affiliations><json:string>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</json:string><json:string>E-mail: saket@imsc.res.in</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><qualityIndicators><score>5.968</score><pdfVersion>1.6</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>0</abstractCharCount><pdfWordCount>4456</pdfWordCount><pdfCharCount>21116</pdfCharCount><pdfPageCount>10</pdfPageCount><abstractWordCount>1</abstractWordCount></qualityIndicators><title>The Curse of Connectivity: t -Total Vertex (Edge) Cover</title><chapterId><json:string>6</json:string><json:string>Chap6</json:string></chapterId><refBibs><json:item><author><json:item><name>N Alon</name></json:item><json:item><name>R Yuster</name></json:item><json:item><name>U Zwick</name></json:item></author><host><volume>42</volume><pages><last>856</last><first>844</first></pages><issue>4</issue><author></author><title>Journal of the Association for Computing Machinery</title><publicationDate>1995</publicationDate></host><title>Color-coding</title><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>O Amini</name></json:item><json:item><name>F,V Fomin</name></json:item><json:item><name>S Saurabh</name></json:item></author><host><pages><last>12</last><first>1</first></pages><author></author><title>IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</title><publicationDate>2008-11</publicationDate></host><title>Implicit branching and parameterized partial cover problems (extended abstract)</title><publicationDate>2008-11</publicationDate></json:item><json:item><author><json:item><name>O Amini</name></json:item><json:item><name>F,V Fomin</name></json:item><json:item><name>S Saurabh</name></json:item></author><host><pages><last>82</last><first>71</first></pages><author></author><title>ICALP 2009</title><publicationDate>2009</publicationDate></host><title>Counting subgraphs via homomorphisms</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>T Beyer</name></json:item><json:item><name>S,M Hedetniemi</name></json:item></author><host><volume>9</volume><pages><last>712</last><first>706</first></pages><issue>4</issue><author></author><title>SIAM Journal on Computing</title><publicationDate>1980</publicationDate></host><title>Constant time generation of rooted trees</title><publicationDate>1980</publicationDate></json:item><json:item><author><json:item><name>H,L Bodlaender</name></json:item><json:item><name>R,G Downey</name></json:item><json:item><name>M,R Fellows</name></json:item><json:item><name>D Hermelin</name></json:item><json:item><name>L Aceto</name></json:item><json:item><name>I Damgård</name></json:item><json:item><name>L,A Goldberg</name></json:item><json:item><name>M,M Halldórsson</name></json:item><json:item><name>A Ingólfsdóttir</name></json:item></author><host><pages><last>574</last><first>563</first></pages><author></author><title>Part I</title><publicationDate>2008</publicationDate></host><title>On problems without polynomial kernels (extended abstract)</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>H,L Bodlaender</name></json:item><json:item><name>S Thomassé</name></json:item><json:item><name>A Yeo</name></json:item></author><host><pages><last>646</last><first>635</first></pages><author></author><title>ESA 2009</title><publicationDate>2009</publicationDate></host><title>Kernel bounds for disjoint cycles and disjoint paths</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>J Chen</name></json:item><json:item><name>I,A Kanj</name></json:item><json:item><name>W Jia</name></json:item></author><host><volume>41</volume><pages><last>301</last><first>280</first></pages><issue>2</issue><author></author><title>Journal of Algorithms</title><publicationDate>2001</publicationDate></host><title>Vertex Cover: Further observations and further improvements</title><publicationDate>2001</publicationDate></json:item><json:item><author><json:item><name>J Chen</name></json:item><json:item><name>I,A Kanj</name></json:item><json:item><name>G Xia</name></json:item></author><host><pages><last>249</last><first>238</first></pages><author></author><title>MFCS 2006</title><publicationDate>2006</publicationDate></host><title>Improved parameterized upper bounds for Vertex Cover</title><publicationDate>2006</publicationDate></json:item><json:item><host><author><json:item><name>T,H Cormen</name></json:item><json:item><name>C,E Leiserson</name></json:item><json:item><name>R,L Rivest</name></json:item><json:item><name>C Stein</name></json:item></author><title>Introduction to Algorithms</title><publicationDate>2001</publicationDate></host></json:item><json:item><host><author><json:item><name>R Diestel</name></json:item></author><title>Graph Theory</title><publicationDate>2005</publicationDate></host></json:item><json:item><author><json:item><name>M Dom</name></json:item><json:item><name>D Lokshtanov</name></json:item><json:item><name>S Saurabh</name></json:item><json:item><name>S Albers</name></json:item><json:item><name>A Marchetti-Spaccamela</name></json:item><json:item><name>Y Matias</name></json:item><json:item><name>S Nikoletseas</name></json:item><json:item><name>W Thomas</name></json:item></author><host><pages><last>389</last><first>378</first></pages><author></author><title>ICALP 2009</title><publicationDate>2009</publicationDate></host><title>Incompressibility through Colors and IDs</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>H Fernau</name></json:item><json:item><name>D,F Manlove</name></json:item></author><host><volume>7</volume><pages><last>167</last><first>149</first></pages><author></author><title>Journal of Discrete Algorithms</title><publicationDate>2009</publicationDate></host><title>Vertex and edge covers with clustering properties: Complexity and algorithms</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>J Flum</name></json:item><json:item><name>M Grohe</name></json:item></author><host><author></author><title>Texts in Theoretical Computer Science. An EATCS Series</title><publicationDate>2006</publicationDate></host><title>Parameterized Complexity Theory</title><publicationDate>2006</publicationDate></json:item><json:item><author><json:item><name>F,V Fomin</name></json:item><json:item><name>D Lokshtanov</name></json:item><json:item><name>V Raman</name></json:item><json:item><name>S Saurabh</name></json:item></author><host><pages><last>201</last><first>193</first></pages><author></author><title>IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</title><publicationDate>2009</publicationDate></host><title>Subexponential algorithms for partial cover problems</title><publicationDate>2009</publicationDate></json:item><json:item><host><author><json:item><name>M,R Garey</name></json:item><json:item><name>D,S Johnson</name></json:item></author><title>Computers and Intractability: A Guide to the Theory of NP–Completeness</title><publicationDate>1979</publicationDate></host></json:item><json:item><author><json:item><name>J Guo</name></json:item><json:item><name>R Niedermeier</name></json:item><json:item><name>S Wernicke</name></json:item></author><host><volume>41</volume><pages><last>520</last><first>501</first></pages><issue>3</issue><author></author><title>Theory of Computing Systems</title><publicationDate>2007</publicationDate></host><title>Parameterized complexity of vertex cover variants</title><publicationDate>2007</publicationDate></json:item><json:item><author><json:item><name>G,H Hardy</name></json:item><json:item><name>S Ramanujan</name></json:item></author><host><volume>17</volume><author></author><title>Proceedings of the London Mathematical Society</title><publicationDate>1918</publicationDate></host><title>Asymptotic formulae in combinatory analysis</title><publicationDate>1918</publicationDate></json:item><json:item><author><json:item><name>R,M Karp</name></json:item></author><host><pages><last>103</last><first>85</first></pages><author></author><title>Complexity of Computer Communications The Curse of Connectivity: t-Total Vertex</title><publicationDate>1972</publicationDate></host><title>Reducibility among combinatorial problems</title><publicationDate>1972</publicationDate></json:item><json:item><author><json:item><name>J Kneis</name></json:item><json:item><name>A Langer</name></json:item><json:item><name>P Rossmanith</name></json:item></author><host><volume>5344</volume><pages><last>251</last><first>240</first></pages><author></author><title>LNCS</title><publicationDate>2008</publicationDate></host><title>Improved upper bounds for partial vertex cover</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>J Kneis</name></json:item><json:item><name>D Mölle</name></json:item><json:item><name>S Richter</name></json:item><json:item><name>P Rossmanith</name></json:item></author><host><pages><last>607</last><first>598</first></pages><author></author><title>ISAAC 2006</title><publicationDate>2006</publicationDate></host><title>Intuitive algorithms and t-vertex cover</title><publicationDate>2006</publicationDate></json:item><json:item><author><json:item><name>D,E Knuth</name></json:item></author><host><volume>3</volume><author></author><title>Seminumerical Algorithms</title><publicationDate>1998</publicationDate></host><title>The Art of Computer Programming</title><publicationDate>1998</publicationDate></json:item><json:item><author><json:item><name>D Mölle</name></json:item><json:item><name>S Richter</name></json:item><json:item><name>P Rossmanith</name></json:item></author><host><volume>43</volume><pages><last>253</last><first>234</first></pages><issue>2</issue><author></author><title>Theory of Computing Systems</title><publicationDate>2008</publicationDate></host><title>Enumerate and Expand: Improved algorithms for Connected Vertex Cover and Tree Cover</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>M Naor</name></json:item><json:item><name>L,J Schulman</name></json:item><json:item><name>A Srinivasan</name></json:item></author><host><pages><last>193</last><first>182</first></pages><author></author><title>36th Annual Symposium on Foundations of Computer Science (FOCS '95)</title><publicationDate>1995</publicationDate></host><title>Splitters and near-optimal derandomization</title><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>R,Z Norman</name></json:item><json:item><name>M,O Rabin</name></json:item></author><host><volume>10</volume><pages><last>319</last><first>315</first></pages><author></author><title>Proceedings of the American Mathematical Society</title><publicationDate>1959</publicationDate></host><title>An algorithm for a minimum cover of a graph</title><publicationDate>1959</publicationDate></json:item><json:item><author><json:item><name>R Otter</name></json:item></author><host><volume>49</volume><pages><last>599</last><first>583</first></pages><issue>3</issue><author></author><title>Annals of Mathematics</title><publicationDate>1948</publicationDate></host><title>The number of trees</title><publicationDate>1948</publicationDate></json:item><json:item><author><json:item><name>A Zoghbi</name></json:item><json:item><name>I Stojmenovic</name></json:item></author><host><volume>70</volume><pages><last>332</last><first>319</first></pages><author></author><title>International Journal of Computer Mathematics</title><publicationDate>1998</publicationDate></host><title>Fast algorithms for generating integer partitions</title><publicationDate>1998</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2010</copyrightDate></serie><host><editor><json:item><name>My T. Thai</name><affiliations><json:string>University of Florida, CSE Building, Room 566, P.O. Box 116120, 32611-6120, Gainesville, Florida, USA</json:string><json:string>E-mail: mythai@cise.ufl.edu</json:string></affiliations></json:item><json:item><name>Sartaj Sahni</name><affiliations><json:string>Department of Computer and Information Science and Technology, University of Florida, P.O. Box, USA</json:string><json:string>E-mail: Sahni@cise.ful.edu</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Discrete Mathematics in Computer Science</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Computer Graphics</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item></subject><isbn><json:string>978-3-642-14030-3</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Computing and Combinatorics</title><bookId><json:string>978-3-642-14031-0</json:string></bookId><volume>6196</volume><pages><last>43</last><first>34</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-14031-0</json:string></eisbn><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-14031-0</json:string></doi></host><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-14031-0_6</json:string></doi><id>CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF</id><score>0.3160753</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">The Curse of Connectivity: t -Total Vertex (Edge) Cover</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2010</p></availability><date>2010</date></publicationStmt><notesStmt><note type="content">both problems remain fixed-parameter tractable with these restrictions, with running times of the form ${\mathcal O}^{*}\left(c^{k}\right)$ for some constant c > 0 in each case;</note><note type="content">for every t ≥ 2, t-total vertex cover has no polynomial kernel unless the Polynomial Hierarchy collapses to the third level;</note><note type="content">for every t ≥ 2, t-total edge cover has a linear vertex kernel of size $\frac{t+1}{t}k$ .</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">The Curse of Connectivity: t -Total Vertex (Edge) Cover</title><author xml:id="author-1"><persName><forename type="first">Henning</forename><surname>Fernau</surname></persName><email>fernau@uni-trier.de</email><affiliation>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Fedor</forename><surname>Fomin</surname></persName><email>fomin@ii.uib.no</email><affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</affiliation></author><author xml:id="author-3"><persName><forename type="first">Geevarghese</forename><surname>Philip</surname></persName><email>gphilip@imsc.res.in</email><affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</affiliation></author><author xml:id="author-4"><persName><forename type="first">Saket</forename><surname>Saurabh</surname></persName><email>saket@imsc.res.in</email><affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</affiliation></author></analytic><monogr><title level="m">Computing and Combinatorics</title><title level="m" type="sub">16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings</title><idno type="pISBN">978-3-642-14030-3</idno><idno type="eISBN">978-3-642-14031-0</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-14031-0</idno><idno type="book-ID">978-3-642-14031-0</idno><idno type="book-title-ID">212166</idno><idno type="book-sequence-number">6196</idno><idno type="book-volume-number">6196</idno><idno type="book-chapter-count">56</idno><editor><persName><forename type="first">My</forename><forename type="first">T.</forename><surname>Thai</surname></persName><email>mythai@cise.ufl.edu</email><affiliation>University of Florida, CSE Building, Room 566, P.O. Box 116120, 32611-6120, Gainesville, Florida, USA</affiliation></editor><editor><persName><forename type="first">Sartaj</forename><surname>Sahni</surname></persName><email>Sahni@cise.ful.edu</email><affiliation>Department of Computer and Information Science and Technology, University of Florida, P.O. Box, USA</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2010"></date><biblScope unit="volume">6196</biblScope><biblScope unit="page" from="34">34</biblScope><biblScope unit="page" to="43">43</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2010</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF</idno><idno type="DOI">10.1007/978-3-642-14031-0_6</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2010</date></creation><langUsage><language ident="en">en</language></langUsage><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16021</label><label>I17028</label><label>I13022</label><label>I16013</label><label>I22013</label><label>I21017</label><item><term>Computer Science</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Discrete Mathematics in Computer Science</term></item><item><term>Computer Communication Networks</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Computer Graphics</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2010">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-14031-0</BookID><BookTitle>Computing and Combinatorics</BookTitle><BookSubTitle>16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings</BookSubTitle><BookVolumeNumber>6196</BookVolumeNumber><BookSequenceNumber>6196</BookSequenceNumber><BookDOI>10.1007/978-3-642-14031-0</BookDOI><BookTitleID>212166</BookTitleID><BookPrintISBN>978-3-642-14030-3</BookPrintISBN><BookElectronicISBN>978-3-642-14031-0</BookElectronicISBN><BookChapterCount>56</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16021" Priority="1" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I17028" Priority="2" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject><BookSubject Code="I13022" Priority="3" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I16013" Priority="4" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I22013" Priority="5" Type="Secondary">Computer Graphics</BookSubject><BookSubject Code="I21017" Priority="6" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>My</GivenName><GivenName>T.</GivenName><FamilyName>Thai</FamilyName></EditorName><Contact><Email>mythai@cise.ufl.edu</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Sartaj</GivenName><FamilyName>Sahni</FamilyName></EditorName><Contact><Email>Sahni@cise.ful.edu</Email></Contact></Editor><Affiliation ID="Aff16"><OrgName>University of Florida</OrgName><OrgAddress><Street>CSE Building, Room 566</Street><Postbox>P.O. Box 116120</Postbox><Postcode>32611-6120</Postcode><City>Gainesville</City><State>Florida</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgDivision>Department of Computer and Information Science and Technology</OrgDivision><OrgName>University of Florida</OrgName><OrgAddress><Postbox>P.O. Box</Postbox><Country>USA</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID><PartSequenceNumber>2</PartSequenceNumber><PartTitle>Complexity and Inapproximability</PartTitle><PartChapterCount>6</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Computing and Combinatorics</BookTitle></PartContext></PartInfo><Chapter ID="Chap6" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>6</ChapterID><ChapterDOI>10.1007/978-3-642-14031-0_6</ChapterDOI><ChapterSequenceNumber>6</ChapterSequenceNumber><ChapterTitle Language="En">The Curse of Connectivity: <Emphasis Type="Italic">t</Emphasis>-Total Vertex (Edge) Cover</ChapterTitle><ChapterFirstPage>34</ChapterFirstPage><ChapterLastPage>43</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>2</PartID><BookID>978-3-642-14031-0</BookID><BookTitle>Computing and Combinatorics</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Henning</GivenName><FamilyName>Fernau</FamilyName></AuthorName><Contact><Email>fernau@uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Fedor</GivenName><GivenName>V.</GivenName><FamilyName>Fomin</FamilyName></AuthorName><Contact><Email>fomin@ii.uib.no</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Geevarghese</GivenName><FamilyName>Philip</FamilyName></AuthorName><Contact><Email>gphilip@imsc.res.in</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Saket</GivenName><FamilyName>Saurabh</FamilyName></AuthorName><Contact><Email>saket@imsc.res.in</Email></Contact></Author><Affiliation ID="Aff18"><OrgName>Universität Trier FB 4—Abteilung Informatik</OrgName><OrgAddress><Postcode>54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgDivision>Department of Informatics</OrgDivision><OrgName>University of Bergen</OrgName><OrgAddress><Postcode>5020</Postcode><City>Bergen</City><Country>Norway</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgName>The Institute of Mathematical Sciences</OrgName><OrgAddress><Street>Taramani</Street><City>Chennai</City><Postcode>600 113</Postcode><Country>India</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We investigate the effect of certain natural connectivity constraints on the parameterized complexity of two fundamental graph covering problems, namely <Emphasis Type="Italic">k</Emphasis>-<Emphasis Type="SmallCaps">Vertex Cover</Emphasis> and <Emphasis Type="Italic">k</Emphasis>-<Emphasis Type="SmallCaps">Edge Cover</Emphasis>. Specifically, we impose the additional requirement that each connected component of a solution have at least <Emphasis Type="Italic">t</Emphasis> vertices (resp. edges from the solution), and call the problem <Emphasis Type="Italic">t</Emphasis>-<Emphasis Type="SmallCaps">total vertex cover</Emphasis> (resp. <Emphasis Type="Italic">t</Emphasis>-<Emphasis Type="SmallCaps">total edge cover</Emphasis>). We show that</Para><Para><UnorderedList Mark="Bullet"><ItemContent><Para>both problems remain fixed-parameter tractable with these restrictions, with running times of the form <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject FileRef="978-3-642-14031-0_6_Chapter_TeX2GIFIEq1.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">${\mathcal O}^{*}\left(c^{k}\right)$</EquationSource></InlineEquation> for some constant <Emphasis Type="Italic">c</Emphasis> > 0 in each case;</Para></ItemContent><ItemContent><Para>for every <Emphasis Type="Italic">t</Emphasis> ≥ 2, <Emphasis Type="Italic">t</Emphasis>-<Emphasis Type="SmallCaps">total vertex cover</Emphasis> has no polynomial kernel unless the Polynomial Hierarchy collapses to the third level;</Para></ItemContent><ItemContent><Para>for every <Emphasis Type="Italic">t</Emphasis> ≥ 2, <Emphasis Type="Italic">t</Emphasis>-<Emphasis Type="SmallCaps">total edge cover</Emphasis> has a linear vertex kernel of size <InlineEquation ID="IEq2"><InlineMediaObject><ImageObject FileRef="978-3-642-14031-0_6_Chapter_TeX2GIFIEq2.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">$\frac{t+1}{t}k$</EquationSource></InlineEquation>.</Para></ItemContent></UnorderedList></Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>The Curse of Connectivity: t -Total Vertex (Edge) Cover</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>The Curse of Connectivity: t-Total Vertex (Edge) Cover</title></titleInfo><name type="personal"><namePart type="given">Henning</namePart><namePart type="family">Fernau</namePart><affiliation>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</affiliation><affiliation>E-mail: fernau@uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Fedor</namePart><namePart type="given">V.</namePart><namePart type="family">Fomin</namePart><affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</affiliation><affiliation>E-mail: fomin@ii.uib.no</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Geevarghese</namePart><namePart type="family">Philip</namePart><affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</affiliation><affiliation>E-mail: gphilip@imsc.res.in</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Saket</namePart><namePart type="family">Saurabh</namePart><affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</affiliation><affiliation>E-mail: saket@imsc.res.in</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2010</dateIssued><copyrightDate encoding="w3cdtf">2010</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><note type="content">both problems remain fixed-parameter tractable with these restrictions, with running times of the form ${\mathcal O}^{*}\left(c^{k}\right)$ for some constant c > 0 in each case;</note><note type="content">for every t ≥ 2, t-total vertex cover has no polynomial kernel unless the Polynomial Hierarchy collapses to the third level;</note><note type="content">for every t ≥ 2, t-total edge cover has a linear vertex kernel of size $\frac{t+1}{t}k$ .</note><relatedItem type="host"><titleInfo><title>Computing and Combinatorics</title><subTitle>16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">My</namePart><namePart type="given">T.</namePart><namePart type="family">Thai</namePart><affiliation>University of Florida, CSE Building, Room 566, P.O. Box 116120, 32611-6120, Gainesville, Florida, USA</affiliation><affiliation>E-mail: mythai@cise.ufl.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Sartaj</namePart><namePart type="family">Sahni</namePart><affiliation>Department of Computer and Information Science and Technology, University of Florida, P.O. Box, USA</affiliation><affiliation>E-mail: Sahni@cise.ful.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic></subject><identifier type="DOI">10.1007/978-3-642-14031-0</identifier><identifier type="ISBN">978-3-642-14030-3</identifier><identifier type="eISBN">978-3-642-14031-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">212166</identifier><identifier type="BookID">978-3-642-14031-0</identifier><identifier type="BookChapterCount">56</identifier><identifier type="BookVolumeNumber">6196</identifier><identifier type="BookSequenceNumber">6196</identifier><identifier type="PartChapterCount">6</identifier><part><date>2010</date><detail type="part"><title>Complexity and Inapproximability</title></detail><detail type="volume"><number>6196</number><caption>vol.</caption></detail><extent unit="pages"><start>34</start><end>43</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><identifier type="istex">CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF</identifier><identifier type="DOI">10.1007/978-3-642-14031-0_6</identifier><identifier type="ChapterID">6</identifier><identifier type="ChapterID">Chap6</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2010</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001105 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001105 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:CC07A5A6F0E0C40AD1D48F99D8C0F4D4A5D717AF
|texte= The Curse of Connectivity: t -Total Vertex (Edge) Cover
}}
| This area was generated with Dilib version V0.6.31. |  |