Approximability and Hardness in Multi-objective Optimization
Identifieur interne : 001017 ( Istex/Corpus ); précédent : 001016; suivant : 001018Approximability and Hardness in Multi-objective Optimization
Auteurs : Christian Gla Er ; Christian Reitwie Ner ; Heinz Schmitz ; Maximilian WitekSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Url:
DOI: 10.1007/978-3-642-13962-8_20
Links to Exploration step
ISTEX:1182BEB3D362E19DD2BF882C51817000039621FCLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Approximability and Hardness in Multi-objective Optimization</title><author><name sortKey="Gla Er, Christian" sort="Gla Er, Christian" uniqKey="Gla Er C" first="Christian" last="Gla Er">Christian Gla Er</name><affiliation><mods:affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: glasser@informatik.uni-wuerzburg.de</mods:affiliation></affiliation></author><author><name sortKey="Reitwie Ner, Christian" sort="Reitwie Ner, Christian" uniqKey="Reitwie Ner C" first="Christian" last="Reitwie Ner">Christian Reitwie Ner</name><affiliation><mods:affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: reitwiessner@informatik.uni-wuerzburg.de</mods:affiliation></affiliation></author><author><name sortKey="Schmitz, Heinz" sort="Schmitz, Heinz" uniqKey="Schmitz H" first="Heinz" last="Schmitz">Heinz Schmitz</name><affiliation><mods:affiliation>Fachbereich Informatik, Fachhochschule Trier, Schneidershof, 54293, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: schmitz@informatik.fh-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Witek, Maximilian" sort="Witek, Maximilian" uniqKey="Witek M" first="Maximilian" last="Witek">Maximilian Witek</name><affiliation><mods:affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: witek@informatik.uni-wuerzburg.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1182BEB3D362E19DD2BF882C51817000039621FC</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-13962-8_20</idno><idno type="url">https://api.istex.fr/document/1182BEB3D362E19DD2BF882C51817000039621FC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001017</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001017</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Approximability and Hardness in Multi-objective Optimization</title><author><name sortKey="Gla Er, Christian" sort="Gla Er, Christian" uniqKey="Gla Er C" first="Christian" last="Gla Er">Christian Gla Er</name><affiliation><mods:affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: glasser@informatik.uni-wuerzburg.de</mods:affiliation></affiliation></author><author><name sortKey="Reitwie Ner, Christian" sort="Reitwie Ner, Christian" uniqKey="Reitwie Ner C" first="Christian" last="Reitwie Ner">Christian Reitwie Ner</name><affiliation><mods:affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: reitwiessner@informatik.uni-wuerzburg.de</mods:affiliation></affiliation></author><author><name sortKey="Schmitz, Heinz" sort="Schmitz, Heinz" uniqKey="Schmitz H" first="Heinz" last="Schmitz">Heinz Schmitz</name><affiliation><mods:affiliation>Fachbereich Informatik, Fachhochschule Trier, Schneidershof, 54293, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: schmitz@informatik.fh-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Witek, Maximilian" sort="Witek, Maximilian" uniqKey="Witek M" first="Maximilian" last="Witek">Maximilian Witek</name><affiliation><mods:affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: witek@informatik.uni-wuerzburg.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">1182BEB3D362E19DD2BF882C51817000039621FC</idno><idno type="DOI">10.1007/978-3-642-13962-8_20</idno><idno type="ChapterID">20</idno><idno type="ChapterID">Chap20</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>Christian Glaßer</name><affiliations><json:string>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</json:string><json:string>E-mail: glasser@informatik.uni-wuerzburg.de</json:string></affiliations></json:item><json:item><name>Christian Reitwießner</name><affiliations><json:string>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</json:string><json:string>E-mail: reitwiessner@informatik.uni-wuerzburg.de</json:string></affiliations></json:item><json:item><name>Heinz Schmitz</name><affiliations><json:string>Fachbereich Informatik, Fachhochschule Trier, Schneidershof, 54293, Trier, Germany</json:string><json:string>E-mail: schmitz@informatik.fh-trier.de</json:string></affiliations></json:item><json:item><name>Maximilian Witek</name><affiliations><json:string>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</json:string><json:string>E-mail: witek@informatik.uni-wuerzburg.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><qualityIndicators><score>5.716</score><pdfVersion>1.6</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>0</abstractCharCount><pdfWordCount>4204</pdfWordCount><pdfCharCount>22286</pdfCharCount><pdfPageCount>10</pdfPageCount><abstractWordCount>1</abstractWordCount></qualityIndicators><title>Approximability and Hardness in Multi-objective Optimization</title><chapterId><json:string>20</json:string><json:string>Chap20</json:string></chapterId><refBibs><json:item><author><json:item><name>R Bar-Yehuda</name></json:item><json:item><name>S Even</name></json:item></author><host><volume>25</volume><pages><last>46</last><first>27</first></pages><author></author><title>Annals of Discrete Mathematics</title><publicationDate>1985</publicationDate></host><title>A local ratio theorem for approximating the weighted vertex cover problem Analysis and Design of Algorithms for Combinatorial Problems</title><publicationDate>1985</publicationDate></json:item><json:item><host><author><json:item><name>N Christofides</name></json:item></author><title>Worst-case analysis of a new heuristic for the travelling salesman problem</title><publicationDate>1976</publicationDate></host></json:item><json:item><host><author><json:item><name>M Ehrgott</name></json:item></author><title>Multicriteria Optimization</title><publicationDate>2005</publicationDate></host></json:item><json:item><author><json:item><name>M Ehrgott</name></json:item><json:item><name>X Gandibleux</name></json:item></author><host><volume>22</volume><pages><last>460</last><first>425</first></pages><issue>4</issue><author></author><title>OR Spectrum</title><publicationDate>2000</publicationDate></host><title>A survey and annotated bibliography of multiobjective combinatorial optimization</title><publicationDate>2000</publicationDate></json:item><json:item><author><json:item><name>M Ehrgott</name></json:item><json:item><name>X Gandibleux</name></json:item></author><host><author></author><title>Kluwer's International Series in Operations Research and Management Science</title><publicationDate>2002</publicationDate></host><title>Multiple Criteria Optimization: State of the Art Annotated Bibliographic Survey</title><publicationDate>2002</publicationDate></json:item><json:item><author><json:item><name>N Garg</name></json:item></author><host><pages><last>309</last><first>302</first></pages><author></author><title>37th Annual Symposium on Foundations of Computer Science</title><publicationDate>1996</publicationDate></host><title>A 3-approximation for the minimum tree spanning k vertices</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>C Glaßer</name></json:item><json:item><name>C Reitwießner</name></json:item><json:item><name>H Schmitz</name></json:item><json:item><name>M Witek</name></json:item></author><host><author></author><title>Electronic Colloquium on Computational Complexity</title><publicationDate>2010</publicationDate></host><title>Hardness and approximability in multi-objective optimization</title><publicationDate>2010</publicationDate></json:item><json:item><author><json:item><name>C,Y Lee</name></json:item><json:item><name>G,L Vairaktarakis</name></json:item></author><host><pages><last>298</last><first>269</first></pages><author></author><title>Complexity in Numerical Optimization</title><publicationDate>1993</publicationDate></host><title>Complexity of single machine hierarchical scheduling: A survey</title><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>B Monien</name></json:item><json:item><name>E Speckenmeyer</name></json:item></author><host><volume>22</volume><pages><last>123</last><first>115</first></pages><issue>1</issue><author></author><title>Acta Informatica</title><publicationDate>1985</publicationDate></host><title>Ramsey numbers and an approximation algorithm for the vertex cover problem</title><publicationDate>1985</publicationDate></json:item><json:item><author><json:item><name>C,H Papadimitriou</name></json:item><json:item><name>M Yannakakis</name></json:item></author><host><pages><last>95</last><first>86</first></pages><author></author><title>FOCS 2000: Proceedings of the 41st Annual Symposium on Foundations of Computer Science</title><publicationDate>2000</publicationDate></host><title>On the approximability of trade-offs and optimal access of web sources</title><publicationDate>2000</publicationDate></json:item><json:item><author><json:item><name>H Saran</name></json:item><json:item><name>V,V Vazirani</name></json:item></author><host><pages><last>751</last><first>743</first></pages><author></author><title>32nd Annual Symposium on Foundations of Computer Science</title><publicationDate>1991</publicationDate></host><title>Finding k-cuts within twice the optimal</title><publicationDate>1991</publicationDate></json:item><json:item><author><json:item><name>A,L Selman</name></json:item></author><host><volume>48</volume><pages><last>381</last><first>357</first></pages><author></author><title>Journal of Computer and System Sciences</title><publicationDate>1994</publicationDate></host><title>A taxonomy on complexity classes of functions</title><publicationDate>1994</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>Fernando Ferreira</name><affiliations><json:string>Departamento de Matemática, Universidade de Lisboa, Campo Grande, Edifício C6, 1749-016, Lisboa, Portugal</json:string><json:string>E-mail: ferferr@cii.fc.ul.pt</json:string></affiliations></json:item><json:item><name>Benedikt Löwe</name><affiliations><json:string>Institute for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, P.O. Box 94242, 1090, Amsterdam, GE, The Netherlands</json:string><json:string>E-mail: bloewe@uva.nl</json:string></affiliations></json:item><json:item><name>Elvira Mayordomo</name><affiliations><json:string>Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, María de Luna 1, 50018, Zaragoza, Spain</json:string><json:string>E-mail: elvira@unizar.es</json:string></affiliations></json:item><json:item><name>Luís Mendes Gomes</name><affiliations><json:string>Universidade dos Açores, Campus de Ponta Delgada, Apartado 1422, 9501-801, Ponta Delgada, Açores, Portugal</json:string><json:string>E-mail: luis.mendesgomes@gmail.com</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>Computation by Abstract Devices</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Discrete Mathematics in Computer Science</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Simulation and Modeling</value></json:item></subject><isbn><json:string>978-3-642-13961-1</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Programs, Proofs, Processes</title><bookId><json:string>978-3-642-13962-8</json:string></bookId><volume>6158</volume><pages><last>189</last><first>180</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-13962-8</json:string></eisbn><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-13962-8</json:string></doi></host><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-13962-8_20</json:string></doi><id>1182BEB3D362E19DD2BF882C51817000039621FC</id><score>0.26827934</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/1182BEB3D362E19DD2BF882C51817000039621FC/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/1182BEB3D362E19DD2BF882C51817000039621FC/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/1182BEB3D362E19DD2BF882C51817000039621FC/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Approximability and Hardness in Multi-objective Optimization</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">We define and compare several solution notions that capture reasonable algorithmic tasks for computing optimal solutions.</note><note type="content">These solution notions induce corresponding NP-hardness notions for which we prove implication and separation results.</note><note type="content">We define approximative solution notions and investigate in which cases polynomial-time solvability translates from one to another notion. Moreover, for problems where all objectives have to be minimized, approximability results translate from single-objective to multi-objective optimization such that the relative error degrades only by a constant factor. Such translations are not possible for problems where all objectives have to be maximized (unless P = NP).</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Approximability and Hardness in Multi-objective Optimization</title><author xml:id="author-1"><persName><forename type="first">Christian</forename><surname>Glaßer</surname></persName><email>glasser@informatik.uni-wuerzburg.de</email><affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Christian</forename><surname>Reitwießner</surname></persName><email>reitwiessner@informatik.uni-wuerzburg.de</email><affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</affiliation></author><author xml:id="author-3"><persName><forename type="first">Heinz</forename><surname>Schmitz</surname></persName><email>schmitz@informatik.fh-trier.de</email><affiliation>Fachbereich Informatik, Fachhochschule Trier, Schneidershof, 54293, Trier, Germany</affiliation></author><author xml:id="author-4"><persName><forename type="first">Maximilian</forename><surname>Witek</surname></persName><email>witek@informatik.uni-wuerzburg.de</email><affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</affiliation></author></analytic><monogr><title level="m">Programs, Proofs, Processes</title><title level="m" type="sub">6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 – July 4, 2010. Proceedings</title><idno type="pISBN">978-3-642-13961-1</idno><idno type="eISBN">978-3-642-13962-8</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-13962-8</idno><idno type="book-ID">978-3-642-13962-8</idno><idno type="book-title-ID">212042</idno><idno type="book-sequence-number">6158</idno><idno type="book-volume-number">6158</idno><idno type="book-chapter-count">48</idno><editor><persName><forename type="first">Fernando</forename><surname>Ferreira</surname></persName><email>ferferr@cii.fc.ul.pt</email><affiliation>Departamento de Matemática, Universidade de Lisboa, Campo Grande, Edifício C6, 1749-016, Lisboa, Portugal</affiliation></editor><editor><persName><forename type="first">Benedikt</forename><surname>Löwe</surname></persName><email>bloewe@uva.nl</email><affiliation>Institute for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, P.O. Box 94242, 1090, Amsterdam, GE, The Netherlands</affiliation></editor><editor><persName><forename type="first">Elvira</forename><surname>Mayordomo</surname></persName><email>elvira@unizar.es</email><affiliation>Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, María de Luna 1, 50018, Zaragoza, Spain</affiliation></editor><editor><persName><forename type="first">Luís</forename><surname>Mendes Gomes</surname></persName><email>luis.mendesgomes@gmail.com</email><affiliation>Universidade dos Açores, Campus de Ponta Delgada, Apartado 1422, 9501-801, Ponta Delgada, Açores, Portugal</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2010"></date><biblScope unit="volume">6158</biblScope><biblScope unit="page" from="180">180</biblScope><biblScope unit="page" to="189">189</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">1182BEB3D362E19DD2BF882C51817000039621FC</idno><idno type="DOI">10.1007/978-3-642-13962-8_20</idno><idno type="ChapterID">20</idno><idno type="ChapterID">Chap20</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>I16013</label><label>I21017</label><label>I17028</label><label>I16048</label><label>I21025</label><item><term>Computer Science</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Discrete Mathematics in Computer Science</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Simulation and Modeling</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/1182BEB3D362E19DD2BF882C51817000039621FC/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-13962-8</BookID><BookTitle>Programs, Proofs, Processes</BookTitle><BookSubTitle>6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 – July 4, 2010. Proceedings</BookSubTitle><BookVolumeNumber>6158</BookVolumeNumber><BookSequenceNumber>6158</BookSequenceNumber><BookDOI>10.1007/978-3-642-13962-8</BookDOI><BookTitleID>212042</BookTitleID><BookPrintISBN>978-3-642-13961-1</BookPrintISBN><BookElectronicISBN>978-3-642-13962-8</BookElectronicISBN><BookChapterCount>48</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="I16013" Priority="2" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I21017" Priority="3" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I17028" Priority="4" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject><BookSubject Code="I16048" Priority="5" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I21025" Priority="6" Type="Secondary">Simulation and Modeling</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Fernando</GivenName><FamilyName>Ferreira</FamilyName></EditorName><Contact><Email>ferferr@cii.fc.ul.pt</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Benedikt</GivenName><FamilyName>Löwe</FamilyName></EditorName><Contact><Email>bloewe@uva.nl</Email></Contact></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Elvira</GivenName><FamilyName>Mayordomo</FamilyName></EditorName><Contact><Email>elvira@unizar.es</Email></Contact></Editor><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Luís</GivenName><FamilyName>Mendes Gomes</FamilyName></EditorName><Contact><Email>luis.mendesgomes@gmail.com</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Departamento de Matemática</OrgDivision><OrgName>Universidade de Lisboa</OrgName><OrgAddress><Street>Campo Grande, Edifício C6</Street><Postcode>1749-016</Postcode><City>Lisboa</City><Country>Portugal</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgDivision>Institute for Logic, Language and Computation (ILLC)</OrgDivision><OrgName>Universiteit van Amsterdam</OrgName><OrgAddress><Postbox>P.O. Box 94242</Postbox><Postcode>1090</Postcode><City>Amsterdam</City><State>GE</State><Country>The Netherlands</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgDivision>Departamento de Informática e Ingeniería de Sistemas</OrgDivision><OrgName>Universidad de Zaragoza</OrgName><OrgAddress><Street>María de Luna 1</Street><Postcode>50018</Postcode><City>Zaragoza</City><Country>Spain</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgName>Universidade dos Açores</OrgName><OrgAddress><Street>Campus de Ponta Delgada, Apartado 1422</Street><Postcode>9501-801</Postcode><City>Ponta Delgada, Açores</City><Country>Portugal</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap20" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>20</ChapterID><ChapterDOI>10.1007/978-3-642-13962-8_20</ChapterDOI><ChapterSequenceNumber>20</ChapterSequenceNumber><ChapterTitle Language="En">Approximability and Hardness in Multi-objective Optimization</ChapterTitle><ChapterFirstPage>180</ChapterFirstPage><ChapterLastPage>189</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-13962-8</BookID><BookTitle>Programs, Proofs, Processes</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Christian</GivenName><FamilyName>Glaßer</FamilyName></AuthorName><Contact><Email>glasser@informatik.uni-wuerzburg.de</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Christian</GivenName><FamilyName>Reitwießner</FamilyName></AuthorName><Contact><Email>reitwiessner@informatik.uni-wuerzburg.de</Email></Contact></Author><Author AffiliationIDS="Aff21"><AuthorName DisplayOrder="Western"><GivenName>Heinz</GivenName><FamilyName>Schmitz</FamilyName></AuthorName><Contact><Email>schmitz@informatik.fh-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Maximilian</GivenName><FamilyName>Witek</FamilyName></AuthorName><Contact><Email>witek@informatik.uni-wuerzburg.de</Email></Contact></Author><Affiliation ID="Aff20"><OrgDivision>Lehrstuhl für Theoretische Informatik</OrgDivision><OrgName>Julius-Maximilians-Universität Würzburg</OrgName><OrgAddress><Street>Am Hubland</Street><Postcode>97074</Postcode><City>Würzburg</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgName>Fachbereich Informatik, Fachhochschule Trier, Schneidershof</OrgName><OrgAddress><Postcode>54293</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We study the approximability and the hardness of combinatorial multi-objective NP optimization problems (multi-objective problems, for short). Our contributions are:</Para><Para><UnorderedList Mark="Bullet"><ItemContent><Para>We define and compare several solution notions that capture reasonable algorithmic tasks for computing optimal solutions.</Para></ItemContent><ItemContent><Para>These solution notions induce corresponding NP-hardness notions for which we prove implication and separation results.</Para></ItemContent><ItemContent><Para>We define approximative solution notions and investigate in which cases polynomial-time solvability translates from one to another notion. Moreover, for problems where all objectives have to be minimized, approximability results translate from single-objective to multi-objective optimization such that the relative error degrades only by a constant factor. Such translations are not possible for problems where all objectives have to be maximized (unless P = NP).</Para></ItemContent></UnorderedList></Para><Para>As a consequence we see that in contrast to single-objective problems (where the solution notions coincide), the situation is more subtle for multiple objectives. So it is important to exactly specify the NP-hardness notion when discussing the complexity of multi-objective problems.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Approximability and Hardness in Multi-objective Optimization</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Approximability and Hardness in Multi-objective Optimization</title></titleInfo><name type="personal"><namePart type="given">Christian</namePart><namePart type="family">Glaßer</namePart><affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</affiliation><affiliation>E-mail: glasser@informatik.uni-wuerzburg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Christian</namePart><namePart type="family">Reitwießner</namePart><affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</affiliation><affiliation>E-mail: reitwiessner@informatik.uni-wuerzburg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Heinz</namePart><namePart type="family">Schmitz</namePart><affiliation>Fachbereich Informatik, Fachhochschule Trier, Schneidershof, 54293, Trier, Germany</affiliation><affiliation>E-mail: schmitz@informatik.fh-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Maximilian</namePart><namePart type="family">Witek</namePart><affiliation>Lehrstuhl für Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074, Würzburg, Germany</affiliation><affiliation>E-mail: witek@informatik.uni-wuerzburg.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><note type="content">We define and compare several solution notions that capture reasonable algorithmic tasks for computing optimal solutions.</note><note type="content">These solution notions induce corresponding NP-hardness notions for which we prove implication and separation results.</note><note type="content">We define approximative solution notions and investigate in which cases polynomial-time solvability translates from one to another notion. Moreover, for problems where all objectives have to be minimized, approximability results translate from single-objective to multi-objective optimization such that the relative error degrades only by a constant factor. Such translations are not possible for problems where all objectives have to be maximized (unless P = NP).</note><relatedItem type="host"><titleInfo><title>Programs, Proofs, Processes</title><subTitle>6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 – July 4, 2010. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Fernando</namePart><namePart type="family">Ferreira</namePart><affiliation>Departamento de Matemática, Universidade de Lisboa, Campo Grande, Edifício C6, 1749-016, Lisboa, Portugal</affiliation><affiliation>E-mail: ferferr@cii.fc.ul.pt</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Benedikt</namePart><namePart type="family">Löwe</namePart><affiliation>Institute for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, P.O. Box 94242, 1090, Amsterdam, GE, The Netherlands</affiliation><affiliation>E-mail: bloewe@uva.nl</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Elvira</namePart><namePart type="family">Mayordomo</namePart><affiliation>Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, María de Luna 1, 50018, Zaragoza, Spain</affiliation><affiliation>E-mail: elvira@unizar.es</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Luís</namePart><namePart type="family">Mendes Gomes</namePart><affiliation>Universidade dos Açores, Campus de Ponta Delgada, Apartado 1422, 9501-801, Ponta Delgada, Açores, Portugal</affiliation><affiliation>E-mail: luis.mendesgomes@gmail.com</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="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I21025">Simulation and Modeling</topic></subject><identifier type="DOI">10.1007/978-3-642-13962-8</identifier><identifier type="ISBN">978-3-642-13961-1</identifier><identifier type="eISBN">978-3-642-13962-8</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">212042</identifier><identifier type="BookID">978-3-642-13962-8</identifier><identifier type="BookChapterCount">48</identifier><identifier type="BookVolumeNumber">6158</identifier><identifier type="BookSequenceNumber">6158</identifier><part><date>2010</date><detail type="volume"><number>6158</number><caption>vol.</caption></detail><extent unit="pages"><start>180</start><end>189</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">1182BEB3D362E19DD2BF882C51817000039621FC</identifier><identifier type="DOI">10.1007/978-3-642-13962-8_20</identifier><identifier type="ChapterID">20</identifier><identifier type="ChapterID">Chap20</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 001017 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001017 | 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:1182BEB3D362E19DD2BF882C51817000039621FC
|texte= Approximability and Hardness in Multi-objective Optimization
}}
| This area was generated with Dilib version V0.6.31. |  |