发布求助
文献互助 智能选刊 最新文献

International Symposium on Parameterized and Exact Computation最新文献

筛选
英文 中文
Parameter Compilation 参数编译
International Symposium on Parameterized and Exact Computation Pub Date : 2015-03-01 DOI: 10.4230/LIPIcs.IPEC.2015.127
Hubie Chen
{"title":"Parameter Compilation","authors":"Hubie Chen","doi":"10.4230/LIPIcs.IPEC.2015.127","DOIUrl":"https://doi.org/10.4230/LIPIcs.IPEC.2015.127","url":null,"abstract":"In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is relatively expensive. In this article, we introduce a formal framework for classifying problems according to their compilability. The basic object in our framework is that of a parameterized problem, which here is a language along with a parameterization—a map which provides, for each instance, a so-called parameter on which compilation may be performed. Our framework is positioned within the paradigm of parameterized complexity, and our notions are relatable to established concepts in the theory of parameterized complexity. Indeed, we view our framework as playing a unifying role, integrating together parameterized complexity and compilability theory.","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129128649","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}
引用次数: 4
Optimal dynamic program for r-domination problems over tree decompositions 树分解上r控制问题的最优动态规划
International Symposium on Parameterized and Exact Computation Pub Date : 2015-02-01 DOI: 10.4230/LIPIcs.IPEC.2016.8
G. Borradaile, Hung Le
{"title":"Optimal dynamic program for r-domination problems over tree decompositions","authors":"G. Borradaile, Hung Le","doi":"10.4230/LIPIcs.IPEC.2016.8","DOIUrl":"https://doi.org/10.4230/LIPIcs.IPEC.2016.8","url":null,"abstract":"There has been recent progress in showing that the exponential dependence on treewidth in dynamic programming algorithms for solving NP-hard problems are optimal under the Strong Exponential Time Hypothesis (SETH). We extend this work to $r$-domination problems. In $r$-dominating set, one wished to find a minimum subset $S$ of vertices such that every vertex of $G$ is within $r$ hops of some vertex in $S$. In connected $r$-dominating set, one additionally requires that the set induces a connected subgraph of $G$. We give a $O((2r+1)^{mathrm{tw}} n)$ time algorithm for $r$-dominating set and a $O((2r+2)^{mathrm{tw}} n^{O(1)})$ time algorithm for connected $r$-dominating set in $n$-vertex graphs of treewidth $mathrm{tw}$. We show that the running time dependence on $r$ and $mathrm{tw}$ is the best possible under SETH. This adds to earlier observations that a \"+1\" in the denominator is required for connectivity constraints.","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133844609","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}
引用次数: 29
On Kernels for Covering and Packing ILPs with Small Coefficients 小系数ILPs覆盖和填充的核问题
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_26
Stefan Kratsch, Vuong Anh Quyen
{"title":"On Kernels for Covering and Packing ILPs with Small Coefficients","authors":"Stefan Kratsch, Vuong Anh Quyen","doi":"10.1007/978-3-319-13524-3_26","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_26","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121716613","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}
引用次数: 2
Lower Bounds for Kernelization 核化的下界
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_1
H. Bodlaender
{"title":"Lower Bounds for Kernelization","authors":"H. Bodlaender","doi":"10.1007/978-3-319-13524-3_1","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_1","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"372 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115280182","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}
引用次数: 3
Shortest Paths in Nearly Conservative Digraphs 近保守有向图中的最短路径
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_20
Z. Király
{"title":"Shortest Paths in Nearly Conservative Digraphs","authors":"Z. Király","doi":"10.1007/978-3-319-13524-3_20","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_20","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114952624","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}
引用次数: 1
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration 有界长度图重着色与CSP重构的复杂性
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_10
P. Bonsma, A. E. Mouawad, N. Nishimura, Venkatesh Raman
{"title":"The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration","authors":"P. Bonsma, A. E. Mouawad, N. Nishimura, Venkatesh Raman","doi":"10.1007/978-3-319-13524-3_10","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_10","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123201804","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}
引用次数: 44
Parameterized Inapproximability of Degree Anonymization 程度匿名化的参数化不可逼近性
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_7
C. Bazgan, A. Nichterlein
{"title":"Parameterized Inapproximability of Degree Anonymization","authors":"C. Bazgan, A. Nichterlein","doi":"10.1007/978-3-319-13524-3_7","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_7","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124213110","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}
引用次数: 8
The k -Distinct Language: Parameterized Automata Constructions k -Distinct语言:参数化自动机构造
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_8
R. Ben-Basat, Ariel Gabizon, M. Zehavi
{"title":"The k -Distinct Language: Parameterized Automata Constructions","authors":"R. Ben-Basat, Ariel Gabizon, M. Zehavi","doi":"10.1007/978-3-319-13524-3_8","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_8","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117047551","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}
引用次数: 1
On Polynomial Kernelization of H -free Edge Deletion 无H边删除的多项式核化
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_3
N. Aravind, R. B. Sandeep, N. Sivadasan
{"title":"On Polynomial Kernelization of H -free Edge Deletion","authors":"N. Aravind, R. B. Sandeep, N. Sivadasan","doi":"10.1007/978-3-319-13524-3_3","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_3","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133114811","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}
引用次数: 8
Finite Integer Index of Pathwidth and Treewidth 路径宽度和树宽度的有限整数索引
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_22
Jakub Gajarský, J. Obdržálek, S. Ordyniak, F. Reidl, P. Rossmanith, Fernando Sánchez Villaamil, S. Sikdar
{"title":"Finite Integer Index of Pathwidth and Treewidth","authors":"Jakub Gajarský, J. Obdržálek, S. Ordyniak, F. Reidl, P. Rossmanith, Fernando Sánchez Villaamil, S. Sikdar","doi":"10.1007/978-3-319-13524-3_22","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_22","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126181387","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信