Ranking and Drawing in Subexponential Time
Identifieur interne : 001B43 ( Istex/Corpus ); précédent : 001B42; suivant : 001B44Ranking and Drawing in Subexponential Time
Auteurs : Henning Fernau ; Fedor V. Fomin ; Daniel Lokshtanov ; Matthias Mnich ; Geevarghese Philip ; Saket SaurabhSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: In this paper we obtain parameterized subexponential-time algorithms for p -Kemeny Aggregation (p-KAGG) — a problem in social choice theory — and for p -One-Sided Crossing Minimization (p-OSCM) – a problem in graph drawing (see the introduction for definitions). These algorithms run in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , where k is the parameter, and significantly improve the previous best algorithms with running times $\cal{O}^{*}$ (1.403 k ) and $\cal{O}^{*}$ (1.4656 k ), respectively. We also study natural “above-guarantee” versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p -Directed Feedback Arc Set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of “votes” in the input to p-KAGG is odd the above guarantee version can still be solved in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails (equivalently, unless FPT=M[1]).
Url:
DOI: 10.1007/978-3-642-19222-7_34
Links to Exploration step
ISTEX:54CF86FA7D9FF5D7596EBBD629923242C0567E4FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Ranking and Drawing in Subexponential Time</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><mods:affiliation>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fernau@uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Fomin, Fedor V" sort="Fomin, Fedor V" uniqKey="Fomin F" first="Fedor V." last="Fomin">Fedor V. Fomin</name><affiliation><mods:affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fomin@ii.uib.no</mods:affiliation></affiliation></author><author><name sortKey="Lokshtanov, Daniel" sort="Lokshtanov, Daniel" uniqKey="Lokshtanov D" first="Daniel" last="Lokshtanov">Daniel Lokshtanov</name><affiliation><mods:affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: daniello@ii.uib.no</mods:affiliation></affiliation></author><author><name sortKey="Mnich, Matthias" sort="Mnich, Matthias" uniqKey="Mnich M" first="Matthias" last="Mnich">Matthias Mnich</name><affiliation><mods:affiliation>Eindhoven University of Technology, Eindhoven, The Netherlands</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: m.mnich@tue.nl</mods:affiliation></affiliation></author><author><name sortKey="Philip, Geevarghese" sort="Philip, Geevarghese" uniqKey="Philip G" first="Geevarghese" last="Philip">Geevarghese Philip</name><affiliation><mods:affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: gphilip@imsc.res.in</mods:affiliation></affiliation></author><author><name sortKey="Saurabh, Saket" sort="Saurabh, Saket" uniqKey="Saurabh S" first="Saket" last="Saurabh">Saket Saurabh</name><affiliation><mods:affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: saket@imsc.res.in</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:54CF86FA7D9FF5D7596EBBD629923242C0567E4F</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-19222-7_34</idno><idno type="url">https://api.istex.fr/document/54CF86FA7D9FF5D7596EBBD629923242C0567E4F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001B43</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001B43</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Ranking and Drawing in Subexponential Time</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><mods:affiliation>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fernau@uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Fomin, Fedor V" sort="Fomin, Fedor V" uniqKey="Fomin F" first="Fedor V." last="Fomin">Fedor V. Fomin</name><affiliation><mods:affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: fomin@ii.uib.no</mods:affiliation></affiliation></author><author><name sortKey="Lokshtanov, Daniel" sort="Lokshtanov, Daniel" uniqKey="Lokshtanov D" first="Daniel" last="Lokshtanov">Daniel Lokshtanov</name><affiliation><mods:affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: daniello@ii.uib.no</mods:affiliation></affiliation></author><author><name sortKey="Mnich, Matthias" sort="Mnich, Matthias" uniqKey="Mnich M" first="Matthias" last="Mnich">Matthias Mnich</name><affiliation><mods:affiliation>Eindhoven University of Technology, Eindhoven, The Netherlands</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: m.mnich@tue.nl</mods:affiliation></affiliation></author><author><name sortKey="Philip, Geevarghese" sort="Philip, Geevarghese" uniqKey="Philip G" first="Geevarghese" last="Philip">Geevarghese Philip</name><affiliation><mods:affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: gphilip@imsc.res.in</mods:affiliation></affiliation></author><author><name sortKey="Saurabh, Saket" sort="Saurabh, Saket" uniqKey="Saurabh S" first="Saket" last="Saurabh">Saket Saurabh</name><affiliation><mods:affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: saket@imsc.res.in</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">54CF86FA7D9FF5D7596EBBD629923242C0567E4F</idno><idno type="DOI">10.1007/978-3-642-19222-7_34</idno><idno type="ChapterID">34</idno><idno type="ChapterID">Chap34</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: In this paper we obtain parameterized subexponential-time algorithms for p -Kemeny Aggregation (p-KAGG) — a problem in social choice theory — and for p -One-Sided Crossing Minimization (p-OSCM) – a problem in graph drawing (see the introduction for definitions). These algorithms run in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , where k is the parameter, and significantly improve the previous best algorithms with running times $\cal{O}^{*}$ (1.403 k ) and $\cal{O}^{*}$ (1.4656 k ), respectively. We also study natural “above-guarantee” versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p -Directed Feedback Arc Set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of “votes” in the input to p-KAGG is odd the above guarantee version can still be solved in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails (equivalently, unless FPT=M[1]).</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Henning Fernau</name><affiliations><json:string>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</json:string><json:string>E-mail: fernau@uni-trier.de</json:string></affiliations></json:item><json:item><name>Fedor V. Fomin</name><affiliations><json:string>Department of Informatics, University of Bergen, 5020, Bergen, Norway</json:string><json:string>E-mail: fomin@ii.uib.no</json:string></affiliations></json:item><json:item><name>Daniel Lokshtanov</name><affiliations><json:string>Department of Informatics, University of Bergen, 5020, Bergen, Norway</json:string><json:string>E-mail: daniello@ii.uib.no</json:string></affiliations></json:item><json:item><name>Matthias Mnich</name><affiliations><json:string>Eindhoven University of Technology, Eindhoven, The Netherlands</json:string><json:string>E-mail: m.mnich@tue.nl</json:string></affiliations></json:item><json:item><name>Geevarghese Philip</name><affiliations><json:string>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</json:string><json:string>E-mail: gphilip@imsc.res.in</json:string></affiliations></json:item><json:item><name>Saket Saurabh</name><affiliations><json:string>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</json:string><json:string>E-mail: saket@imsc.res.in</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: In this paper we obtain parameterized subexponential-time algorithms for p -Kemeny Aggregation (p-KAGG) — a problem in social choice theory — and for p -One-Sided Crossing Minimization (p-OSCM) – a problem in graph drawing (see the introduction for definitions). These algorithms run in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , where k is the parameter, and significantly improve the previous best algorithms with running times $\cal{O}^{*}$ (1.403 k ) and $\cal{O}^{*}$ (1.4656 k ), respectively. We also study natural “above-guarantee” versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p -Directed Feedback Arc Set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of “votes” in the input to p-KAGG is odd the above guarantee version can still be solved in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails (equivalently, unless FPT=M[1]).</abstract><qualityIndicators><score>8.636</score><pdfVersion>1.6</pdfVersion><pdfPageSize>429.725 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>1211</abstractCharCount><pdfWordCount>5808</pdfWordCount><pdfCharCount>28264</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>178</abstractWordCount></qualityIndicators><title>Ranking and Drawing in Subexponential Time</title><chapterId><json:string>34</json:string><json:string>Chap34</json:string></chapterId><refBibs><json:item><author><json:item><name>N Ailon</name></json:item><json:item><name>M Charikar</name></json:item><json:item><name>A Newman</name></json:item></author><host><volume>55</volume><pages><last>2327</last><first>1</first></pages><issue>23</issue><author></author><title>J.ACM</title><publicationDate>2008</publicationDate></host><title>Aggregating inconsistent information: Ranking and clustering</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>J Alber</name></json:item><json:item><name>H Fernau</name></json:item><json:item><name>R Niedermeier</name></json:item></author><host><volume>52</volume><pages><last>56</last><first>26</first></pages><author></author><title>Journal of Algorithms</title><publicationDate>2004</publicationDate></host><title>Parameterized complexity: exponential speedup for planar graph problems</title><publicationDate>2004</publicationDate></json:item><json:item><author><json:item><name>N Alon</name></json:item><json:item><name>D Lokshtanov</name></json:item><json:item><name>S Saurabh</name></json:item><json:item><name>S Albers</name></json:item><json:item><name>A Marchetti-Spaccamela</name></json:item><json:item><name>Y Matias</name></json:item><json:item><name>S,E Nikoletseas</name></json:item><json:item><name>W Thomas</name></json:item></author><host><pages><last>58</last><first>49</first></pages><author></author><title>ICALP 2009</title><publicationDate>2009</publicationDate></host><title>Fast FAST</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>C Bachmaier</name></json:item></author><host><volume>13</volume><pages><last>594</last><first>583</first></pages><issue>3</issue><author></author><title>IEEE Transactions on Visualization and Computer Graphics</title><publicationDate>2007</publicationDate></host><title>A radial adaptation of the Sugiyama framework for visualizing hierarchical information</title><publicationDate>2007</publicationDate></json:item><json:item><author><json:item><name>Iii Bartholdi</name></json:item><json:item><name>J Tovey</name></json:item><json:item><name>C,A Trick</name></json:item><json:item><name>M,A </name></json:item></author><host><volume>6</volume><pages><last>165</last><first>157</first></pages><author></author><title>Social Choice and Welfare</title><publicationDate>1989</publicationDate></host><title>Voting schemes for which it can be difficult to tell who won the election</title><publicationDate>1989</publicationDate></json:item><json:item><author><json:item><name>N Betzler</name></json:item><json:item><name>M,R Fellows</name></json:item><json:item><name>J Guo</name></json:item><json:item><name>R Niedermeier</name></json:item><json:item><name>Rosamond </name></json:item><json:item><name>F,A </name></json:item></author><host><pages><last>71</last><first>60</first></pages><author></author><title>AAIM 2008</title><publicationDate>2008</publicationDate></host><title>Fixedparameter algorithms for Kemeny scores</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>T,C Biedl</name></json:item><json:item><name>F.-J Brandenburg</name></json:item><json:item><name>X Deng</name></json:item></author><host><pages><last>12</last><first>1</first></pages><author></author><title>GD 2005</title><publicationDate>2006</publicationDate></host><title>Crossings and permutations</title><publicationDate>2006</publicationDate></json:item><json:item><author><json:item><name>O,A Çakiroglu</name></json:item><json:item><name>C Erten</name></json:item><json:item><name>Ö Karatas</name></json:item><json:item><name>M Sözdinler</name></json:item></author><host><pages><last>135</last><first>122</first></pages><author></author><title>WEA 2007</title><publicationDate>2007</publicationDate></host><title>Crossing minimization in weighted bipartite graphs</title><publicationDate>2007</publicationDate></json:item><json:item><author><json:item><name>J Chen</name></json:item><json:item><name>Y Liu</name></json:item><json:item><name>S Lu</name></json:item><json:item><name>B Sullivan</name></json:item><json:item><name>I Razgon</name></json:item></author><host><volume>55</volume><pages><last>2119</last><first>1</first></pages><issue>21</issue><author></author><title>JACM</title><publicationDate>2008</publicationDate></host><title>A fixed-parameter algorithm for the directed feedback vertex set problem</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>E,D Demaine</name></json:item><json:item><name>F,V Fomin</name></json:item><json:item><name>M,T Hajiaghayi</name></json:item><json:item><name>D,M Thilikos</name></json:item></author><host><pages><last>832</last><first>823</first></pages><author></author><title>Proceedings of SODA 2004</title><publicationDate>2004</publicationDate></host><title>Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs</title><publicationDate>2004</publicationDate></json:item><json:item><author><json:item><name>F Dorn</name></json:item><json:item><name>F,V Fomin</name></json:item><json:item><name>D,M Thilikos</name></json:item></author><host><volume>4596</volume><pages><last>27</last><first>15</first></pages><author></author><title>LNCS</title><publicationDate>2007</publicationDate></host><title>Subexponential parameterized algorithms</title><publicationDate>2007</publicationDate></json:item><json:item><author><json:item><name>V Dujmović</name></json:item><json:item><name>M,R Fellows</name></json:item><json:item><name>M Hallett</name></json:item><json:item><name>M Kitching</name></json:item><json:item><name>G Liotta</name></json:item><json:item><name>C Mccartin</name></json:item><json:item><name>N Nishimura</name></json:item><json:item><name>P Ragde</name></json:item><json:item><name>Rosamond </name></json:item><json:item><name>F,A Suderman</name></json:item><json:item><name>M Whitesides</name></json:item><json:item><name>S Wood</name></json:item><json:item><name>D,R </name></json:item></author><host><volume>45</volume><pages><last>182</last><first>159</first></pages><author></author><title>Algorithmica</title><publicationDate>2006</publicationDate></host><title>A fixed-parameter approach to 2-layer planarization</title><publicationDate>2006</publicationDate></json:item><json:item><author><json:item><name>V Dujmović</name></json:item><json:item><name>M,R Fellows</name></json:item><json:item><name>M Kitching</name></json:item><json:item><name>G Liotta</name></json:item><json:item><name>C Mccartin</name></json:item><json:item><name>N Nishimura</name></json:item><json:item><name>P Ragde</name></json:item><json:item><name>Rosamond </name></json:item><json:item><name>F,A Whitesides</name></json:item><json:item><name>S Wood</name></json:item><json:item><name>D,R </name></json:item></author><host><volume>52</volume><pages><last>292</last><first>267</first></pages><issue>2</issue><author></author><title>Algorithmica</title><publicationDate>2008</publicationDate></host><title>On the parameterized complexity of layered graph drawing</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>V Dujmović</name></json:item><json:item><name>H Fernau</name></json:item><json:item><name>M Kaufmann</name></json:item></author><host><pages><last>344</last><first>332</first></pages><author></author><title>GD 2003</title><publicationDate>2004</publicationDate></host><title>Fixed parameter algorithms for one-sided crossing minimization revisited</title><publicationDate>2004</publicationDate></json:item><json:item><author><json:item><name>V Dujmović</name></json:item><json:item><name>H Fernau</name></json:item><json:item><name>M Kaufmann</name></json:item></author><host><volume>6</volume><pages><last>323</last><first>313</first></pages><author></author><title>Journal of Discrete Algorithms</title><publicationDate>2008</publicationDate></host><title>Fixed parameter algorithms for onesided crossing minimization revisited</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>V Dujmović</name></json:item><json:item><name>S Whitesides</name></json:item></author><host><volume>40</volume><pages><last>32</last><first>15</first></pages><author></author><title>Algorithmica</title><publicationDate>2004</publicationDate></host><title>An efficient fixed parameter tractable algorithm for 1-sided crossing minimization</title><publicationDate>2004</publicationDate></json:item><json:item><host><pages><last>1</last><first>10</first></pages><author><json:item><name>C Dwork</name></json:item><json:item><name>R Kumar</name></json:item><json:item><name>M Naor</name></json:item><json:item><name>D Sivakumar</name></json:item></author><title>Rank aggregation revisited</title></host></json:item><json:item><author><json:item><name>P Eades</name></json:item><json:item><name>N,C Wormald</name></json:item></author><host><volume>11</volume><pages><last>403</last><first>379</first></pages><author></author><title>Algorithmica</title><publicationDate>1994</publicationDate></host><title>Edge crossings in drawings of bipartite graphs</title><publicationDate>1994</publicationDate></json:item><json:item><host><author><json:item><name>J Flum</name></json:item><json:item><name>M Grohe</name></json:item></author><title>Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series</title><publicationDate>2006</publicationDate></host></json:item><json:item><author><json:item><name>M Forster</name></json:item></author><host><pages><last>216</last><first>206</first></pages><author></author><title>GD 2004</title><publicationDate>2005</publicationDate></host><title>A fast and simple heuristic for constrained two-level crossing reduction</title><publicationDate>2005</publicationDate></json:item><json:item><author><json:item><name>A Guénoche</name></json:item><json:item><name>B Vandeputte-Riboud</name></json:item><json:item><name>J Denis</name></json:item></author><host><volume>14</volume><pages><last>375</last><first>363</first></pages><author></author><title>Agronomie</title><publicationDate>1994</publicationDate></host><title>Selecting varieties using a series of trials and a combinatorial ordering method</title><publicationDate>1994</publicationDate></json:item><json:item><author><json:item><name>R Impagliazzo</name></json:item><json:item><name>R Paturi</name></json:item><json:item><name>F Zane</name></json:item></author><host><volume>63</volume><pages><last>530</last><first>512</first></pages><issue>4</issue><author></author><title>Journal of Computer and System Sciences</title><publicationDate>2001</publicationDate></host><title>Which problems have strongly exponential complexity?</title><publicationDate>2001</publicationDate></json:item><json:item><author><json:item><name>R,M Karp</name></json:item></author><host><pages><last>103</last><first>85</first></pages><author></author><title>Complexity of Computer Communications</title><publicationDate>1972</publicationDate></host><title>Reducibility among combinatorial problems</title><publicationDate>1972</publicationDate></json:item><json:item><host><author><json:item><name>M Karpinsky</name></json:item><json:item><name>W Schudy</name></json:item></author><title>Faster algorithms for feedback arc set tournament, kemeny rank aggregation and betweenness tournament</title><publicationDate>2010</publicationDate></host></json:item><json:item><author><json:item><name>J Kemeny</name></json:item></author><host><volume>88</volume><pages><last>591</last><first>571</first></pages><author></author><title>Daedalus</title><publicationDate>1959</publicationDate></host><title>Mathematics without numbers</title><publicationDate>1959</publicationDate></json:item><json:item><author><json:item><name>J Kemeny</name></json:item><json:item><name>J Snell</name></json:item></author><host><author></author><title>Blaisdell</title><publicationDate>1962</publicationDate></host><title>Mathematical models in the social sciences</title><publicationDate>1962</publicationDate></json:item><json:item><author><json:item><name>C Kenyon-Mathieu</name></json:item><json:item><name>W Schudy</name></json:item></author><host><pages><last>103</last><first>95</first></pages><author></author><title>Proceedings of STOC 2007</title><publicationDate>2007</publicationDate></host><title>How to rank with few errors</title><publicationDate>2007</publicationDate></json:item><json:item><author><json:item><name>M Mahajan</name></json:item><json:item><name>V Raman</name></json:item><json:item><name>S Sikdar</name></json:item></author><host><volume>75</volume><pages><last>153</last><first>137</first></pages><issue>2</issue><author></author><title>Journal of Computer and System Sciences</title><publicationDate>2009</publicationDate></host><title>Parameterizing above or below guaranteed values</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>X Muñoz</name></json:item><json:item><name>W Unger</name></json:item><json:item><name>I Vrt 'o</name></json:item></author><host><pages><last>123</last><first>115</first></pages><author></author><title>GD 2001</title><publicationDate>2002</publicationDate></host><title>One sided crossing minimization is NP-hard for sparse graphs</title><publicationDate>2002</publicationDate></json:item><json:item><author><json:item><name>H Nagamochi</name></json:item></author><host><volume>33</volume><pages><last>591</last><first>569</first></pages><author></author><title>Discrete and Computational Geometry</title><publicationDate>2005</publicationDate></host><title>An improved bound on the one-sided minimum crossing number in two-layered drawings</title><publicationDate>2005</publicationDate></json:item><json:item><author><json:item><name>N Simjour</name></json:item></author><host><pages><last>323</last><first>312</first></pages><author></author><title>IWPEC 2009</title><publicationDate>2009</publicationDate></host><title>Improved parameterized algorithms for the Kemeny aggregation problem</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>K Sugiyama</name></json:item><json:item><name>S Tagawa</name></json:item><json:item><name>M Toda</name></json:item></author><host><volume>11</volume><pages><last>125</last><first>109</first></pages><issue>2</issue><author></author><title>IEEE Trans. Systems Man Cybernet</title><publicationDate>1981</publicationDate></host><title>Methods for visual understanding of hierarchical system structures</title><publicationDate>1981</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>2011</copyrightDate></serie><host><editor><json:item><name>Costas S. Iliopoulos</name><affiliations><json:string>Department of Computer Science, University of London, King’s College, The Strand, WC2R 2LS, London, UK</json:string><json:string>E-mail: csi@dcs.kcl.ac.uk</json:string></affiliations></json:item><json:item><name>William F. Smyth</name><affiliations><json:string>Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada</json:string><json:string>E-mail: bill@arg.cas.mcmaster.ca</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>Discrete Mathematics in Computer Science</value></json:item><json:item><value>Symbolic and Algebraic Manipulation</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Data Structures</value></json:item><json:item><value>Algorithms</value></json:item><json:item><value>Coding and Information Theory</value></json:item></subject><isbn><json:string>978-3-642-19221-0</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Combinatorial Algorithms</title><bookId><json:string>978-3-642-19222-7</json:string></bookId><volume>6460</volume><pages><last>348</last><first>337</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-19222-7</json:string></eisbn><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-19222-7</json:string></doi></host><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-19222-7_34</json:string></doi><id>54CF86FA7D9FF5D7596EBBD629923242C0567E4F</id><score>0.27136856</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/54CF86FA7D9FF5D7596EBBD629923242C0567E4F/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/54CF86FA7D9FF5D7596EBBD629923242C0567E4F/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/54CF86FA7D9FF5D7596EBBD629923242C0567E4F/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Ranking and Drawing in Subexponential Time</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, 2011</p></availability><date>2011</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Ranking and Drawing in Subexponential Time</title><author xml:id="author-1"><persName><forename type="first">Henning</forename><surname>Fernau</surname></persName><email>fernau@uni-trier.de</email><affiliation>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Fedor</forename><surname>Fomin</surname></persName><email>fomin@ii.uib.no</email><affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</affiliation></author><author xml:id="author-3"><persName><forename type="first">Daniel</forename><surname>Lokshtanov</surname></persName><email>daniello@ii.uib.no</email><affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</affiliation></author><author xml:id="author-4"><persName><forename type="first">Matthias</forename><surname>Mnich</surname></persName><email>m.mnich@tue.nl</email><affiliation>Eindhoven University of Technology, Eindhoven, The Netherlands</affiliation></author><author xml:id="author-5"><persName><forename type="first">Geevarghese</forename><surname>Philip</surname></persName><email>gphilip@imsc.res.in</email><affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</affiliation></author><author xml:id="author-6"><persName><forename type="first">Saket</forename><surname>Saurabh</surname></persName><email>saket@imsc.res.in</email><affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</affiliation></author></analytic><monogr><title level="m">Combinatorial Algorithms</title><title level="m" type="sub">21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers</title><idno type="pISBN">978-3-642-19221-0</idno><idno type="eISBN">978-3-642-19222-7</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-19222-7</idno><idno type="book-ID">978-3-642-19222-7</idno><idno type="book-title-ID">217049</idno><idno type="book-sequence-number">6460</idno><idno type="book-volume-number">6460</idno><idno type="book-chapter-count">39</idno><editor><persName><forename type="first">Costas</forename><forename type="first">S.</forename><surname>Iliopoulos</surname></persName><email>csi@dcs.kcl.ac.uk</email><affiliation>Department of Computer Science, University of London, King’s College, The Strand, WC2R 2LS, London, UK</affiliation></editor><editor><persName><forename type="first">William</forename><forename type="first">F.</forename><surname>Smyth</surname></persName><email>bill@arg.cas.mcmaster.ca</email><affiliation>Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2011"></date><biblScope unit="volume">6460</biblScope><biblScope unit="page" from="337">337</biblScope><biblScope unit="page" to="348">348</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>2011</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">54CF86FA7D9FF5D7596EBBD629923242C0567E4F</idno><idno type="DOI">10.1007/978-3-642-19222-7_34</idno><idno type="ChapterID">34</idno><idno type="ChapterID">Chap34</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: In this paper we obtain parameterized subexponential-time algorithms for p -Kemeny Aggregation (p-KAGG) — a problem in social choice theory — and for p -One-Sided Crossing Minimization (p-OSCM) – a problem in graph drawing (see the introduction for definitions). These algorithms run in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , where k is the parameter, and significantly improve the previous best algorithms with running times $\cal{O}^{*}$ (1.403 k ) and $\cal{O}^{*}$ (1.4656 k ), respectively. We also study natural “above-guarantee” versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p -Directed Feedback Arc Set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of “votes” in the input to p-KAGG is odd the above guarantee version can still be solved in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails (equivalently, unless FPT=M[1]).</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>I17028</label><label>I17052</label><label>I16021</label><label>I15017</label><label>M14018</label><label>I15041</label><item><term>Computer Science</term></item><item><term>Discrete Mathematics in Computer Science</term></item><item><term>Symbolic and Algebraic Manipulation</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Data Structures</term></item><item><term>Algorithms</term></item><item><term>Coding and Information Theory</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011">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/54CF86FA7D9FF5D7596EBBD629923242C0567E4F/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-19222-7</BookID><BookTitle>Combinatorial Algorithms</BookTitle><BookSubTitle>21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers</BookSubTitle><BookVolumeNumber>6460</BookVolumeNumber><BookSequenceNumber>6460</BookSequenceNumber><BookDOI>10.1007/978-3-642-19222-7</BookDOI><BookTitleID>217049</BookTitleID><BookPrintISBN>978-3-642-19221-0</BookPrintISBN><BookElectronicISBN>978-3-642-19222-7</BookElectronicISBN><BookChapterCount>39</BookChapterCount><BookCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I17028" Priority="1" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject><BookSubject Code="I17052" Priority="2" Type="Secondary">Symbolic and Algebraic Manipulation</BookSubject><BookSubject Code="I16021" Priority="3" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I15017" Priority="4" Type="Secondary">Data Structures</BookSubject><BookSubject Code="M14018" Priority="5" Type="Secondary">Algorithms</BookSubject><BookSubject Code="I15041" Priority="6" Type="Secondary">Coding and Information Theory</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Costas</GivenName><GivenName>S.</GivenName><FamilyName>Iliopoulos</FamilyName></EditorName><Contact><Email>csi@dcs.kcl.ac.uk</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>William</GivenName><GivenName>F.</GivenName><FamilyName>Smyth</FamilyName></EditorName><Contact><Email>bill@arg.cas.mcmaster.ca</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of London, King’s College</OrgName><OrgAddress><Street>The Strand</Street><Postcode>WC2R 2LS</Postcode><City>London</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgDivision>Department of Computing and Software</OrgDivision><OrgName>McMaster University</OrgName><OrgAddress><Street>1280 Main Street West</Street><Postcode>L8S 4K1</Postcode><City>Hamilton</City><State>ON</State><Country>Canada</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap34" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>34</ChapterID><ChapterDOI>10.1007/978-3-642-19222-7_34</ChapterDOI><ChapterSequenceNumber>34</ChapterSequenceNumber><ChapterTitle Language="En">Ranking and Drawing in Subexponential Time</ChapterTitle><ChapterFirstPage>337</ChapterFirstPage><ChapterLastPage>348</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</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-19222-7</BookID><BookTitle>Combinatorial Algorithms</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Henning</GivenName><FamilyName>Fernau</FamilyName></AuthorName><Contact><Email>fernau@uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Fedor</GivenName><GivenName>V.</GivenName><FamilyName>Fomin</FamilyName></AuthorName><Contact><Email>fomin@ii.uib.no</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Daniel</GivenName><FamilyName>Lokshtanov</FamilyName></AuthorName><Contact><Email>daniello@ii.uib.no</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Matthias</GivenName><FamilyName>Mnich</FamilyName></AuthorName><Contact><Email>m.mnich@tue.nl</Email></Contact></Author><Author AffiliationIDS="Aff21"><AuthorName DisplayOrder="Western"><GivenName>Geevarghese</GivenName><FamilyName>Philip</FamilyName></AuthorName><Contact><Email>gphilip@imsc.res.in</Email></Contact></Author><Author AffiliationIDS="Aff21"><AuthorName DisplayOrder="Western"><GivenName>Saket</GivenName><FamilyName>Saurabh</FamilyName></AuthorName><Contact><Email>saket@imsc.res.in</Email></Contact></Author><Affiliation ID="Aff18"><OrgName>Universität Trier FB 4—Abteilung Informatik</OrgName><OrgAddress><Postcode>54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgDivision>Department of Informatics</OrgDivision><OrgName>University of Bergen</OrgName><OrgAddress><Postcode>5020</Postcode><City>Bergen</City><Country>Norway</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgName>Eindhoven University of Technology</OrgName><OrgAddress><City>Eindhoven</City><Country>The Netherlands</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgName>The Institute of Mathematical Sciences</OrgName><OrgAddress><Street>Taramani</Street><City>Chennai</City><Postcode>600 113</Postcode><Country>India</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>In this paper we obtain parameterized subexponential-time algorithms for <Emphasis Type="Italic">p</Emphasis><Emphasis Type="SmallCaps">-Kemeny Aggregation</Emphasis> (<Emphasis Type="Italic">p</Emphasis>-KAGG) — a problem in social choice theory — and for <Emphasis Type="Italic">p</Emphasis><Emphasis Type="SmallCaps">-One-Sided Crossing Minimization</Emphasis> (<Emphasis Type="Italic">p</Emphasis>-OSCM) – a problem in graph drawing (see the introduction for definitions). These algorithms run in time <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject FileRef="978-3-642-19222-7_34_Chapter_TeX2GIF_IEq1.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">$\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$</EquationSource></InlineEquation>, where <Emphasis Type="Italic">k</Emphasis> is the parameter, and significantly improve the previous best algorithms with running times <InlineEquation ID="IEq2"><InlineMediaObject><ImageObject FileRef="978-3-642-19222-7_34_Chapter_TeX2GIF_IEq2.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">$\cal{O}^{*}$</EquationSource></InlineEquation>(1.403<Superscript><Emphasis Type="Italic">k</Emphasis></Superscript>) and <InlineEquation ID="IEq3"><InlineMediaObject><ImageObject FileRef="978-3-642-19222-7_34_Chapter_TeX2GIF_IEq3.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">$\cal{O}^{*}$</EquationSource></InlineEquation>(1.4656<Superscript><Emphasis Type="Italic">k</Emphasis></Superscript>), respectively. We also study natural “above-guarantee” versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of <Emphasis Type="Italic">p</Emphasis><Emphasis Type="SmallCaps">-Directed Feedback Arc Set</Emphasis>. Our results for the above-guarantee version of <Emphasis Type="Italic">p</Emphasis>-KAGG reveal an interesting contrast. We show that when the number of “votes” in the input to <Emphasis Type="Italic">p</Emphasis>-KAGG is <Emphasis Type="Italic">odd</Emphasis> the above guarantee version can still be solved in time <InlineEquation ID="IEq4"><InlineMediaObject><ImageObject FileRef="978-3-642-19222-7_34_Chapter_TeX2GIF_IEq4.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">$\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$</EquationSource></InlineEquation>, while if it is <Emphasis Type="Italic">even</Emphasis> then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails (equivalently, unless FPT=M[1]).</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords</Heading><Keyword>Kemeny Aggregation</Keyword><Keyword>One-Sided Crossing Minimization</Keyword><Keyword>Parameterized Complexity</Keyword><Keyword>Subexponential-time Algorithms</Keyword><Keyword>Social Choice Theory</Keyword><Keyword>Graph Drawing</Keyword><Keyword>Directed Feedback Arc Set</Keyword></KeywordGroup></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Ranking and Drawing in Subexponential Time</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Ranking and Drawing in Subexponential Time</title></titleInfo><name type="personal"><namePart type="given">Henning</namePart><namePart type="family">Fernau</namePart><affiliation>Universität Trier FB 4—Abteilung Informatik, 54286, Trier, Germany</affiliation><affiliation>E-mail: fernau@uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Fedor</namePart><namePart type="given">V.</namePart><namePart type="family">Fomin</namePart><affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</affiliation><affiliation>E-mail: fomin@ii.uib.no</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Daniel</namePart><namePart type="family">Lokshtanov</namePart><affiliation>Department of Informatics, University of Bergen, 5020, Bergen, Norway</affiliation><affiliation>E-mail: daniello@ii.uib.no</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Matthias</namePart><namePart type="family">Mnich</namePart><affiliation>Eindhoven University of Technology, Eindhoven, The Netherlands</affiliation><affiliation>E-mail: m.mnich@tue.nl</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Geevarghese</namePart><namePart type="family">Philip</namePart><affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</affiliation><affiliation>E-mail: gphilip@imsc.res.in</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Saket</namePart><namePart type="family">Saurabh</namePart><affiliation>The Institute of Mathematical Sciences, Taramani, 600 113, Chennai, India</affiliation><affiliation>E-mail: saket@imsc.res.in</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2011</dateIssued><copyrightDate encoding="w3cdtf">2011</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: In this paper we obtain parameterized subexponential-time algorithms for p -Kemeny Aggregation (p-KAGG) — a problem in social choice theory — and for p -One-Sided Crossing Minimization (p-OSCM) – a problem in graph drawing (see the introduction for definitions). These algorithms run in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , where k is the parameter, and significantly improve the previous best algorithms with running times $\cal{O}^{*}$ (1.403 k ) and $\cal{O}^{*}$ (1.4656 k ), respectively. We also study natural “above-guarantee” versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p -Directed Feedback Arc Set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of “votes” in the input to p-KAGG is odd the above guarantee version can still be solved in time $\mathcal{O}^{*}(2^{\mathcal{O}(\sqrt{k}{\rm log} k)})$ , while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails (equivalently, unless FPT=M[1]).</abstract><relatedItem type="host"><titleInfo><title>Combinatorial Algorithms</title><subTitle>21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Costas</namePart><namePart type="given">S.</namePart><namePart type="family">Iliopoulos</namePart><affiliation>Department of Computer Science, University of London, King’s College, The Strand, WC2R 2LS, London, UK</affiliation><affiliation>E-mail: csi@dcs.kcl.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">William</namePart><namePart type="given">F.</namePart><namePart type="family">Smyth</namePart><affiliation>Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada</affiliation><affiliation>E-mail: bill@arg.cas.mcmaster.ca</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2011</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="I17028">Discrete Mathematics in Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I17052">Symbolic and Algebraic Manipulation</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic><topic authority="SpringerSubjectCodes" authorityURI="M14018">Algorithms</topic><topic authority="SpringerSubjectCodes" authorityURI="I15041">Coding and Information Theory</topic></subject><identifier type="DOI">10.1007/978-3-642-19222-7</identifier><identifier type="ISBN">978-3-642-19221-0</identifier><identifier type="eISBN">978-3-642-19222-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">217049</identifier><identifier type="BookID">978-3-642-19222-7</identifier><identifier type="BookChapterCount">39</identifier><identifier type="BookVolumeNumber">6460</identifier><identifier type="BookSequenceNumber">6460</identifier><part><date>2011</date><detail type="volume"><number>6460</number><caption>vol.</caption></detail><extent unit="pages"><start>337</start><end>348</end></extent></part><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2011</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">2011</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, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">54CF86FA7D9FF5D7596EBBD629923242C0567E4F</identifier><identifier type="DOI">10.1007/978-3-642-19222-7_34</identifier><identifier type="ChapterID">34</identifier><identifier type="ChapterID">Chap34</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer Berlin Heidelberg, 2011</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</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 001B43 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001B43 | 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:54CF86FA7D9FF5D7596EBBD629923242C0567E4F
|texte= Ranking and Drawing in Subexponential Time
}}
| This area was generated with Dilib version V0.6.31. |  |