Enumerate and Measure: Improving Parameter Budget Management
Identifieur interne : 001A62 ( Istex/Corpus ); précédent : 001A61; suivant : 001A63Enumerate and Measure: Improving Parameter Budget Management
Auteurs : Daniel Binkele-Raible ; Henning FernauSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Abstract
Abstract: Measure & Conquer (M&C) is the prominent technique for analyzing exact algorithms for computationally hard problems . It tries to balance worse and better situations within the algorithm analysis. Several obstacles prevent the application of this technique in parameterized algorithmics, making it rarely applied in this area. However, these difficulties can be handled in some situations. We will exemplify this with two problems related to Vertex Cover, namely Connected Vertex Cover and Edge Dominating Set. For both problems, several parameterized algorithms have been published, all based on the idea of first enumerating minimal vertex covers and then producing solutions to the requested problem. Using M&C in this context will improve on the hitherto published running times, offering some unifying view. In contrast to some of the earlier suggested algorithms, ours will use polynomial space.
Url:
DOI: 10.1007/978-3-642-17493-3_6
Links to Exploration step
ISTEX:91DD40A8DDC779C446188605628AFD7C1FFDA200Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Enumerate and Measure: Improving Parameter Budget Management</title><author><name sortKey="Binkele Raible, Daniel" sort="Binkele Raible, Daniel" uniqKey="Binkele Raible D" first="Daniel" last="Binkele-Raible">Daniel Binkele-Raible</name><affiliation><mods:affiliation>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: raible@informatik.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><mods:affiliation>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fernau@informatik.uni-trier.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:91DD40A8DDC779C446188605628AFD7C1FFDA200</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-17493-3_6</idno><idno type="url">https://api.istex.fr/document/91DD40A8DDC779C446188605628AFD7C1FFDA200/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001A62</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A62</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Enumerate and Measure: Improving Parameter Budget Management</title><author><name sortKey="Binkele Raible, Daniel" sort="Binkele Raible, Daniel" uniqKey="Binkele Raible D" first="Daniel" last="Binkele-Raible">Daniel Binkele-Raible</name><affiliation><mods:affiliation>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: raible@informatik.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><mods:affiliation>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fernau@informatik.uni-trier.de</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">91DD40A8DDC779C446188605628AFD7C1FFDA200</idno><idno type="DOI">10.1007/978-3-642-17493-3_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><front><div type="abstract" xml:lang="en">Abstract: Measure & Conquer (M&C) is the prominent technique for analyzing exact algorithms for computationally hard problems . It tries to balance worse and better situations within the algorithm analysis. Several obstacles prevent the application of this technique in parameterized algorithmics, making it rarely applied in this area. However, these difficulties can be handled in some situations. We will exemplify this with two problems related to Vertex Cover, namely Connected Vertex Cover and Edge Dominating Set. For both problems, several parameterized algorithms have been published, all based on the idea of first enumerating minimal vertex covers and then producing solutions to the requested problem. Using M&C in this context will improve on the hitherto published running times, offering some unifying view. In contrast to some of the earlier suggested algorithms, ours will use polynomial space.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Daniel Binkele-Raible</name><affiliations><json:string>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</json:string><json:string>E-mail: raible@informatik.uni-trier.de</json:string></affiliations></json:item><json:item><name>Henning Fernau</name><affiliations><json:string>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</json:string><json:string>E-mail: fernau@informatik.uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: Measure & Conquer (M&C) is the prominent technique for analyzing exact algorithms for computationally hard problems . It tries to balance worse and better situations within the algorithm analysis. Several obstacles prevent the application of this technique in parameterized algorithmics, making it rarely applied in this area. However, these difficulties can be handled in some situations. We will exemplify this with two problems related to Vertex Cover, namely Connected Vertex Cover and Edge Dominating Set. For both problems, several parameterized algorithms have been published, all based on the idea of first enumerating minimal vertex covers and then producing solutions to the requested problem. Using M&C in this context will improve on the hitherto published running times, offering some unifying view. In contrast to some of the earlier suggested algorithms, ours will use polynomial space.</abstract><qualityIndicators><score>8.12</score><pdfVersion>1.6</pdfVersion><pdfPageSize>429.725 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>911</abstractCharCount><pdfWordCount>6438</pdfWordCount><pdfCharCount>27874</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>135</abstractWordCount></qualityIndicators><title>Enumerate and Measure: Improving Parameter Budget Management</title><chapterId><json:string>6</json:string><json:string>Chap6</json:string></chapterId><refBibs><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><volume>43</volume><pages><last>273</last><first>245</first></pages><author></author><title>Algorithmica</title><publicationDate>2005</publicationDate></host><title>Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems</title><publicationDate>2005</publicationDate></json:item><json:item><author><json:item><name>J Daligault</name></json:item><json:item><name>G Gutin</name></json:item><json:item><name>E,J Kim</name></json:item><json:item><name>A Yeo</name></json:item></author><host><volume>76</volume><pages><last>152</last><first>144</first></pages><author></author><title>J. Comput. Syst. Sci</title><publicationDate>2010</publicationDate></host><title>FPT algorithms and kernels for the directed k-leaf problem</title><publicationDate>2010</publicationDate></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></author><host><pages><last>389</last><first>378</first></pages><author></author><title>Part I</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></author><host><pages><last>153</last><first>142</first></pages><author></author><title>IWPEC 2006</title><publicationDate>2006</publicationDate></host><title>Edge dominating set: efficient enumeration-based exact algorithms</title><publicationDate>2006</publicationDate></json:item><json:item><author><json:item><name>H Fernau</name></json:item><json:item><name>S Gaspers</name></json:item><json:item><name>D Raible</name></json:item></author><host><pages><last>111</last><first>100</first></pages><author></author><title>Graph-Theoretic Concepts in Computer Science</title><publicationDate>2010</publicationDate></host><title>Exact and parameterized algorithms for max internal spanning tree</title><publicationDate>2010</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>J. Disc. Alg</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>H Fernau</name></json:item><json:item><name>D Raible</name></json:item></author><host><pages><last>156</last><first>144</first></pages><author></author><title>WALCOM 2008</title><publicationDate>2008</publicationDate></host><title>Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>F,V Fomin</name></json:item><json:item><name>S Gaspers</name></json:item><json:item><name>S Saurabh</name></json:item><json:item><name>A,A Stepanov</name></json:item></author><host><volume>54</volume><pages><last>207</last><first>181</first></pages><author></author><title>Algorithmica</title><publicationDate>2009</publicationDate></host><title>On two techniques of combining branching and treewidth</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>F,V Fomin</name></json:item><json:item><name>F Grandoni</name></json:item><json:item><name>D Kratsch</name></json:item></author><host><volume>56</volume><issue>5</issue><author></author><title>J. ACM</title><publicationDate>2009</publicationDate></host><title>A measure & conquer approach for the analysis of exact algorithms</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>T Fujito</name></json:item><json:item><name>T Doi</name></json:item></author><host><volume>90</volume><pages><last>63</last><first>59</first></pages><author></author><title>Inform. Process Lett</title><publicationDate>2004</publicationDate></host><title>A 2-approximation NC algorithm for connected vertex cover and tree cover</title><publicationDate>2004</publicationDate></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><author></author><title>Theory Comput. Syst</title><publicationDate>2007</publicationDate></host><title>Parameterized complexity of vertex cover variants</title><publicationDate>2007</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><pages><last>281</last><first>270</first></pages><author></author><title>ISAAC 2008</title><publicationDate>2008</publicationDate></host><title>A new algorithm for finding trees with many leaves</title><publicationDate>2008</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><author></author><title>Theory Comput. Syst</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>J Nederlof</name></json:item></author><host><volume>5555</volume><pages><last>725</last><first>713</first></pages><author></author><title>Part I. LNCS</title><publicationDate>2009</publicationDate></host><title>Fast polynomial-space algorithms using Möbius inversion: Improving on Steiner tree and related problems</title><publicationDate>2009</publicationDate></json:item><json:item><host><author><json:item><name>E Prieto</name></json:item></author><title>Systematic Kernelization in FPT Algorithm Design</title><publicationDate>2005</publicationDate></host></json:item><json:item><author><json:item><name>D Raible</name></json:item><json:item><name>H Fernau</name></json:item></author><host><pages><last>684</last><first>672</first></pages><author></author><title>SOFSEM. LNCS</title><publicationDate>2010</publicationDate></host><title>An amortized search tree analysis for k-Leaf Spanning Tree</title><publicationDate>2010</publicationDate></json:item><json:item><author><json:item><name>V Raman</name></json:item><json:item><name>S Saurabh</name></json:item><json:item><name>S Sikdar</name></json:item></author><host><pages><last>389</last><first>375</first></pages><author></author><title>ICTCS 2005</title><publicationDate>2005</publicationDate></host><title>Improved exact exponential algorithms for vertex bipartization and other problems</title><publicationDate>2005</publicationDate></json:item><json:item><author><json:item><name>J,M M Van Rooij</name></json:item><json:item><name>H,L Bodlaender</name></json:item></author><host><pages><last>668</last><first>657</first></pages><author></author><title>STACS, Schloss Dagstuhl — Leibniz-Zentrum für Informatik</title><publicationDate>2008</publicationDate></host><title>Design by measure and conquer, a faster exact algorithm for dominating set</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>J,M M Van Rooij</name></json:item><json:item><name>H,L Bodlaender</name></json:item></author><host><pages><last>225</last><first>214</first></pages><author></author><title>IWPEC 2008</title><publicationDate>2008</publicationDate></host><title>Exact algorithms for edge domination</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>M Yannakakis</name></json:item><json:item><name>F Gavril</name></json:item></author><host><volume>38</volume><pages><last>372</last><first>364</first></pages><author></author><title>SIAM J. Appl. Math</title><publicationDate>1980</publicationDate></host><title>Edge dominating sets in graphs</title><publicationDate>1980</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>Venkatesh Raman</name><affiliations><json:string>The Institute of Mathematical Sciences, Chennai, India</json:string><json:string>E-mail: vraman@imsc.res.in</json:string></affiliations></json:item><json:item><name>Saket Saurabh</name><affiliations><json:string>The Institute of Mathematical Sciences, 600113, Chennai, India</json:string><json:string>E-mail: saket@imsc.res.in</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>Algorithms</value></json:item><json:item><value>Discrete Mathematics in Computer Science</value></json:item><json:item><value>Theory of Computation</value></json:item><json:item><value>Symbolic and Algebraic Manipulation</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item></subject><isbn><json:string>978-3-642-17492-6</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Parameterized and Exact Computation</title><bookId><json:string>978-3-642-17493-3</json:string></bookId><volume>6478</volume><pages><last>49</last><first>38</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-17493-3</json:string></eisbn><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-17493-3</json:string></doi></host><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-17493-3_6</json:string></doi><id>91DD40A8DDC779C446188605628AFD7C1FFDA200</id><score>0.46968922</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/91DD40A8DDC779C446188605628AFD7C1FFDA200/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/91DD40A8DDC779C446188605628AFD7C1FFDA200/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/91DD40A8DDC779C446188605628AFD7C1FFDA200/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Enumerate and Measure: Improving Parameter Budget Management</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 Berlin Heidelberg, 2010</p></availability><date>2010</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Enumerate and Measure: Improving Parameter Budget Management</title><author xml:id="author-1"><persName><forename type="first">Daniel</forename><surname>Binkele-Raible</surname></persName><email>raible@informatik.uni-trier.de</email><affiliation>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Henning</forename><surname>Fernau</surname></persName><email>fernau@informatik.uni-trier.de</email><affiliation>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</affiliation></author></analytic><monogr><title level="m">Parameterized and Exact Computation</title><title level="m" type="sub">5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings</title><idno type="pISBN">978-3-642-17492-6</idno><idno type="eISBN">978-3-642-17493-3</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-17493-3</idno><idno type="book-ID">978-3-642-17493-3</idno><idno type="book-title-ID">215501</idno><idno type="book-sequence-number">6478</idno><idno type="book-volume-number">6478</idno><idno type="book-chapter-count">22</idno><editor><persName><forename type="first">Venkatesh</forename><surname>Raman</surname></persName><email>vraman@imsc.res.in</email><affiliation>The Institute of Mathematical Sciences, Chennai, India</affiliation></editor><editor><persName><forename type="first">Saket</forename><surname>Saurabh</surname></persName><email>saket@imsc.res.in</email><affiliation>The Institute of Mathematical Sciences, 600113, Chennai, India</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2010"></date><biblScope unit="volume">6478</biblScope><biblScope unit="page" from="38">38</biblScope><biblScope unit="page" to="49">49</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">91DD40A8DDC779C446188605628AFD7C1FFDA200</idno><idno type="DOI">10.1007/978-3-642-17493-3_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><abstract xml:lang="en"><p>Abstract: Measure & Conquer (M&C) is the prominent technique for analyzing exact algorithms for computationally hard problems . It tries to balance worse and better situations within the algorithm analysis. Several obstacles prevent the application of this technique in parameterized algorithmics, making it rarely applied in this area. However, these difficulties can be handled in some situations. We will exemplify this with two problems related to Vertex Cover, namely Connected Vertex Cover and Edge Dominating Set. For both problems, several parameterized algorithms have been published, all based on the idea of first enumerating minimal vertex covers and then producing solutions to the requested problem. Using M&C in this context will improve on the hitherto published running times, offering some unifying view. In contrast to some of the earlier suggested algorithms, ours will use polynomial space.</p></abstract><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>M14018</label><label>I17028</label><label>I16005</label><label>I17052</label><label>I16013</label><item><term>Computer Science</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Algorithms</term></item><item><term>Discrete Mathematics in Computer Science</term></item><item><term>Theory of Computation</term></item><item><term>Symbolic and Algebraic Manipulation</term></item><item><term>Computation by Abstract Devices</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2010">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-23">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-21">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/91DD40A8DDC779C446188605628AFD7C1FFDA200/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-17493-3</BookID><BookTitle>Parameterized and Exact Computation</BookTitle><BookSubTitle>5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings</BookSubTitle><BookVolumeNumber>6478</BookVolumeNumber><BookSequenceNumber>6478</BookSequenceNumber><BookDOI>10.1007/978-3-642-17493-3</BookDOI><BookTitleID>215501</BookTitleID><BookPrintISBN>978-3-642-17492-6</BookPrintISBN><BookElectronicISBN>978-3-642-17493-3</BookElectronicISBN><BookChapterCount>22</BookChapterCount><BookCopyright><CopyrightHolderName>Springer 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="M14018" Priority="2" Type="Secondary">Algorithms</BookSubject><BookSubject Code="I17028" Priority="3" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject><BookSubject Code="I16005" Priority="4" Type="Secondary">Theory of Computation</BookSubject><BookSubject Code="I17052" Priority="5" Type="Secondary">Symbolic and Algebraic Manipulation</BookSubject><BookSubject Code="I16013" Priority="6" Type="Secondary">Computation by Abstract Devices</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Venkatesh</GivenName><FamilyName>Raman</FamilyName></EditorName><Contact><Email>vraman@imsc.res.in</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Saket</GivenName><FamilyName>Saurabh</FamilyName></EditorName><Contact><Email>saket@imsc.res.in</Email></Contact></Editor><Affiliation ID="Aff16"><OrgName>The Institute of Mathematical Sciences</OrgName><OrgAddress><City>Chennai</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>The Institute of Mathematical Sciences</OrgName><OrgAddress><Postcode>600113</Postcode><City>Chennai</City><Country>India</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><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-17493-3_6</ChapterDOI><ChapterSequenceNumber>6</ChapterSequenceNumber><ChapterTitle Language="En">Enumerate and Measure: Improving Parameter Budget Management</ChapterTitle><ChapterFirstPage>38</ChapterFirstPage><ChapterLastPage>49</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><BookID>978-3-642-17493-3</BookID><BookTitle>Parameterized and Exact Computation</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Daniel</GivenName><FamilyName>Binkele-Raible</FamilyName></AuthorName><Contact><Email>raible@informatik.uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Henning</GivenName><FamilyName>Fernau</FamilyName></AuthorName><Contact><Email>fernau@informatik.uni-trier.de</Email></Contact></Author><Affiliation ID="Aff18"><OrgDivision>FB 4—Abteilung Informatik</OrgDivision><OrgName>Univ.Trier</OrgName><OrgAddress><Postcode>54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Measure & Conquer (M&C) is the prominent technique for analyzing exact algorithms for computationally hard problems . It tries to balance worse and better situations within the algorithm analysis.</Para><Para>Several obstacles prevent the application of this technique in parameterized algorithmics, making it rarely applied in this area. However, these difficulties can be handled in some situations. We will exemplify this with two problems related to <Emphasis Type="SmallCaps">Vertex Cover</Emphasis>, namely <Emphasis Type="SmallCaps">Connected Vertex Cover</Emphasis> and <Emphasis Type="SmallCaps">Edge Dominating Set</Emphasis>. For both problems, several parameterized algorithms have been published, all based on the idea of first enumerating minimal vertex covers and then producing solutions to the requested problem. Using M&C in this context will improve on the hitherto published running times, offering some unifying view. In contrast to some of the earlier suggested algorithms, ours will use polynomial space.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Enumerate and Measure: Improving Parameter Budget Management</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Enumerate and Measure: Improving Parameter Budget Management</title></titleInfo><name type="personal"><namePart type="given">Daniel</namePart><namePart type="family">Binkele-Raible</namePart><affiliation>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</affiliation><affiliation>E-mail: raible@informatik.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Henning</namePart><namePart type="family">Fernau</namePart><affiliation>FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany</affiliation><affiliation>E-mail: fernau@informatik.uni-trier.de</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><abstract lang="en">Abstract: Measure & Conquer (M&C) is the prominent technique for analyzing exact algorithms for computationally hard problems . It tries to balance worse and better situations within the algorithm analysis. Several obstacles prevent the application of this technique in parameterized algorithmics, making it rarely applied in this area. However, these difficulties can be handled in some situations. We will exemplify this with two problems related to Vertex Cover, namely Connected Vertex Cover and Edge Dominating Set. For both problems, several parameterized algorithms have been published, all based on the idea of first enumerating minimal vertex covers and then producing solutions to the requested problem. Using M&C in this context will improve on the hitherto published running times, offering some unifying view. In contrast to some of the earlier suggested algorithms, ours will use polynomial space.</abstract><relatedItem type="host"><titleInfo><title>Parameterized and Exact Computation</title><subTitle>5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Venkatesh</namePart><namePart type="family">Raman</namePart><affiliation>The Institute of Mathematical Sciences, Chennai, India</affiliation><affiliation>E-mail: vraman@imsc.res.in</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Saket</namePart><namePart type="family">Saurabh</namePart><affiliation>The Institute of Mathematical Sciences, 600113, Chennai, India</affiliation><affiliation>E-mail: saket@imsc.res.in</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="M14018">Algorithms</topic><topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16005">Theory of Computation</topic><topic authority="SpringerSubjectCodes" authorityURI="I17052">Symbolic and Algebraic Manipulation</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic></subject><identifier type="DOI">10.1007/978-3-642-17493-3</identifier><identifier type="ISBN">978-3-642-17492-6</identifier><identifier type="eISBN">978-3-642-17493-3</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">215501</identifier><identifier type="BookID">978-3-642-17493-3</identifier><identifier type="BookChapterCount">22</identifier><identifier type="BookVolumeNumber">6478</identifier><identifier type="BookSequenceNumber">6478</identifier><part><date>2010</date><detail type="volume"><number>6478</number><caption>vol.</caption></detail><extent unit="pages"><start>38</start><end>49</end></extent></part><recordInfo><recordOrigin>Springer 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 Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><identifier type="istex">91DD40A8DDC779C446188605628AFD7C1FFDA200</identifier><identifier type="DOI">10.1007/978-3-642-17493-3_6</identifier><identifier type="ChapterID">6</identifier><identifier type="ChapterID">Chap6</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer 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 001A62 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001A62 | 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:91DD40A8DDC779C446188605628AFD7C1FFDA200
|texte= Enumerate and Measure: Improving Parameter Budget Management
}}
| This area was generated with Dilib version V0.6.31. |  |