Pub Date : 2014-07-02DOI: 10.1007/978-3-319-08404-6_30
J. Munro, G. Navarro, R. Shah, Sharma V. Thankachan
{"title":"Ranked Document Selection","authors":"J. Munro, G. Navarro, R. Shah, Sharma V. Thankachan","doi":"10.1007/978-3-319-08404-6_30","DOIUrl":"https://doi.org/10.1007/978-3-319-08404-6_30","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116106137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-02DOI: 10.1007/978-3-319-08404-6_6
T. Biedl
{"title":"Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs","authors":"T. Biedl","doi":"10.1007/978-3-319-08404-6_6","DOIUrl":"https://doi.org/10.1007/978-3-319-08404-6_6","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127289694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-27DOI: 10.1007/978-3-319-08404-6_12
Søren Dahlgaard, M. Thorup
{"title":"Approximately Minwise Independence with Twisted Tabulation","authors":"Søren Dahlgaard, M. Thorup","doi":"10.1007/978-3-319-08404-6_12","DOIUrl":"https://doi.org/10.1007/978-3-319-08404-6_12","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114321216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-23DOI: 10.1007/978-3-319-08404-6_28
Ekkehard Köhler, Lalla Mouatadid
{"title":"Linear Time LexDFS on Cocomparability Graphs","authors":"Ekkehard Köhler, Lalla Mouatadid","doi":"10.1007/978-3-319-08404-6_28","DOIUrl":"https://doi.org/10.1007/978-3-319-08404-6_28","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123083978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-15DOI: 10.1007/978-3-319-08404-6_15
G. Dósa, L. Epstein
{"title":"Colorful Bin Packing","authors":"G. Dósa, L. Epstein","doi":"10.1007/978-3-319-08404-6_15","DOIUrl":"https://doi.org/10.1007/978-3-319-08404-6_15","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129266381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-03-27DOI: 10.1007/978-3-319-08404-6_32
Y. Otachi, Pascal Schweitzer
{"title":"Reduction Techniques for Graph Isomorphism in the Context of Width Parameters","authors":"Y. Otachi, Pascal Schweitzer","doi":"10.1007/978-3-319-08404-6_32","DOIUrl":"https://doi.org/10.1007/978-3-319-08404-6_32","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121525333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-03-02DOI: 10.1007/978-3-319-08404-6_24
M. B. T. Knudsen
{"title":"Additive Spanners: A Simple Construction","authors":"M. B. T. Knudsen","doi":"10.1007/978-3-319-08404-6_24","DOIUrl":"https://doi.org/10.1007/978-3-319-08404-6_24","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123614417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-02DOI: 10.4230/LIPIcs.SWAT.2016.17
Andreas Björklund
We show that the two problems of computing the permanent of an n*n matrix of poly(n)-bit integers and counting the number of Hamiltonian cycles in a directed n-vertex multigraph with exp(poly(n)) edges can be reduced to relatively few smaller instances of themselves. In effect we derive the first deterministic algorithms for these two problems that run in o(2^n) time in the worst case. Classic poly(n)2^n time algorithms for the two problems have been known since the early 1960's. Our algorithms run in 2^{n-Omega(sqrt{n/log(n)})} time.
{"title":"Below All Subsets for Some Permutational Counting Problems","authors":"Andreas Björklund","doi":"10.4230/LIPIcs.SWAT.2016.17","DOIUrl":"https://doi.org/10.4230/LIPIcs.SWAT.2016.17","url":null,"abstract":"We show that the two problems of computing the permanent of an n*n matrix of poly(n)-bit integers and counting the number of Hamiltonian cycles in a directed n-vertex multigraph with exp(poly(n)) edges can be reduced to relatively few smaller instances of themselves. In effect we derive the first deterministic algorithms for these two problems that run in o(2^n) time in the worst case. Classic poly(n)2^n time algorithms for the two problems have been known since the early 1960's. \u0000Our algorithms run in 2^{n-Omega(sqrt{n/log(n)})} time.","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"125 20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133640864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-07-04DOI: 10.1007/978-3-642-31155-0_27
Benjamin Doerr, M. Fouz, T. Friedrich
{"title":"Asynchronous Rumor Spreading in Preferential Attachment Graphs","authors":"Benjamin Doerr, M. Fouz, T. Friedrich","doi":"10.1007/978-3-642-31155-0_27","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_27","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126465254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-07-04DOI: 10.1007/978-3-642-31155-0_14
P. Golovach, D. Paulusma, E. J. V. Leeuwen
{"title":"Induced Disjoint Paths in AT-Free Graphs","authors":"P. Golovach, D. Paulusma, E. J. V. Leeuwen","doi":"10.1007/978-3-642-31155-0_14","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_14","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133614220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：