Filters








8 Hits in 8.7 sec

0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms [article]

Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida
2017 arXiv   pre-print
Our algorithm is based on interesting connections among 0/1/all constraints, which has been studied in the field of constraints satisfaction, A-path packing, which has been studied in the field of combinatorial  ...  A recent trend in the design of FPT algorithms is exploiting the half-integrality of LP relaxations.  ...  Because 2-SAT can be expressed as 0/1/all Deletion with k = 0 and d = 2, any linear-time FPT algorithm for 0/1/all Deletion must be able to solve 2-SAT in linear time.  ... 
arXiv:1704.02700v2 fatcat:tidfazvxrjgwlmyj3q3uejcsie

Experimental Evaluation of Parameterized Algorithms for Graph Separation Problems: Half-Integral Relaxations and Matroid-based Kernelization [article]

Marcin Pilipczuk, Michał Ziobro
2018 arXiv   pre-print
We present experimental evaluation of two cornerstone theoretical results in this area: linear-time branching algorithms guided by half-integral relaxations and kernelization (preprocessing) routines based  ...  In the recent years we have witnessed a rapid development of new algorithmic techniques for parameterized algorithms for graph separation problems.  ...  Given a CSP 0/1/all Extension instance (D, G, k, φ 0 ) one can in time O(T k|G|) compute a maximum-size half-integral packing F of conflicting paths.  ... 
arXiv:1811.07779v1 fatcat:w2q6qjlupffujot5op7zkqywey

Half-integrality, LP-branching and FPT Algorithms [chapter]

Magnus Wahlström
2013 Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms  
In addition to the new insight into problems with half-integral relaxations, our results yield a range of new and improved FPT algorithms, including an O * (|Σ| 2k )-time algorithm for node-deletion Unique  ...  Additionally, we propose a network flow-based approach to solve some cases of the relaxation problem. This gives the first linear-time FPT algorithm to edge-deletion Unique Label Cover.  ...  Acknowledgements The second author thanks Marek Cygan, Andreas Karrenbauer, Johan Thapper and StanislavŽivný for enlightening discussions.  ... 
doi:10.1137/1.9781611973402.128 dblp:conf/soda/Wahlstrom14 fatcat:73y5sdxakrdbnng7xblchtyk5u

Half-integrality, LP-branching and FPT Algorithms [article]

Yoichi Iwata and Magnus Wahlström and Yuichi Yoshida
2014 arXiv   pre-print
In addition to the insight into problems with half-integral relaxations, our results yield a range of new and improved FPT algorithms, including an O^*(|Σ|^2k)-time algorithm for node-deletion Unique Label  ...  Additionally, we propose a network flow-based approach to solve some cases of the relaxation problem. This gives the first linear-time FPT algorithm to edge-deletion Unique Label Cover.  ...  Acknowledgements The second author thanks Marek Cygan, Andreas Karrenbauer, Johan Thapper and StanislavŽivný for enlightening discussions.  ... 
arXiv:1310.2841v2 fatcat:wrwnsr6evrdufe7h7gtqs62avu

Half-integrality, LP-branching, and FPT Algorithms

Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida
2016 SIAM journal on computing (Print)  
Our results unify and significantly extend the previously known cases, and yield a range of new and improved FPT algorithms, including an O * (|Σ| 2k )-time algorithm for node-deletion Unique Label Cover  ...  Additionally, we propose a network-flow-based approach to solve several cases of the relaxation problem. This gives the first linear-time FPT algorithm to edge-deletion Unique Label Cover.  ...  The second author thanks Marek Cygan, Andreas Karrenbauer, Johan Thapper and StanislavŽivný for enlightening discussions.  ... 
doi:10.1137/140962838 fatcat:h4xvlh7kjzcl7l7z464psrayi4

Structural Parameterizations with Modulator Oblivion [article]

Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2020 arXiv   pre-print
Instead, we construct a tree decomposition of the given graph in time 2^O(k)n^O(1) where each bag is a union of four cliques and O(k) vertices.  ...  In this work, we design 2^O(k)n^O(1) time algorithms for these problems. Our algorithms do not compute a chordal vertex deletion set (or even an approximate solution).  ...  Yoshida. 0/1/all csps, half-integral a-path packing, and linear-time fpt algorithms. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 462–473.  ... 
arXiv:2002.09972v1 fatcat:m5rmbaghtjfwfgnvmftp2kq4o4

Dagstuhl Reports, Volume 9, Issue 1, January 2019, Complete Issue [article]

2019
We believe that many other problems can be tackled by our framework. 0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms Yoichi Iwata (National Institute of Informatics -Tokyo,  ...  JP) 0/1/all CSPs can be solved in linear time by a simple DFS called a unit propagation.  ...  We establish a new fundamental FPT result on integer programming and hope it will provide a new tool that may allow to establish new FPT results for a variety of combinatorial optimization problems.  ... 
doi:10.4230/dagrep.9.1 fatcat:m3grhk5hanccbg7oxkhos7kv4e

Annual Report 2018
国立情報学研究所 平成30年度(2018年度)年報

" , Random Structures & Algorithms (2018.09)10)YoichiIwata,YutaroYamaguchi,andYuichi Yoshida: "0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms" ,Proceedings of the 59th Annual  ...  Takahashi: ICFP 2018 Programming Contest 1st place (2018.09) ンピュテーション研究会 (2018.12) 5) 岩田陽一: "0/1/All CSPs, Half-Integral A-Path Packing, and LinearTime FPT Algorithms" , Dagstuhl Seminar 19041 (2019.01  ... 
doi:10.20736/0000001316 fatcat:ag6okeeknjeoxglo6j6yylm55y