Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Theory of computation → Linear programming"'
We study the problem of solving linear program in the streaming model. Given a constraint matrix $A\in \mathbb{R}^{m\times n}$ and vectors $b\in \mathbb{R}^m, c\in \mathbb{R}^n$, we develop a space-efficient interior point method that optimizes solel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::153cb389f4de2f781eb3f6d2d356004a
We investigate preprocessing for vertex-subset problems on graphs. While the notion of kernelization, originating in parameterized complexity theory, is a formalization of provably effective preprocessing aimed at reducing the total instance size, ou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::175348f667a6432a945157f63bd854f5
http://arxiv.org/abs/2207.00386
http://arxiv.org/abs/2207.00386
Publikováno v:
Leibniz International Proceedings in Informatics (LIPIcs), 229
49th EATCS International Conference on Automata, Languages, and Programming
49th EATCS International Conference on Automata, Languages, and Programming
We give a nearly-linear time reduction that encodes any linear program as a 2-commodity flow problem with only a small blow-up in size. Under mild assumptions similar to those employed by modern fast solvers for linear programs, our reduction causes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::843ed6de8e026960fbae51fc46dd58b6
http://arxiv.org/abs/2201.11587
http://arxiv.org/abs/2201.11587
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c19753a37740f965274159d7f92b57a5
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee4feba6a7425c51d63f41832c606963
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
Autor:
Rubert, Diego, Martinez, Fábio V., Dias Vieira Braga, Marília, Kingsford, Carl, Pisanti, Nadia
Publikováno v:
Algorithms for Molecular Biology, Vol 16, Iss 1, Pp 1-16 (2021)
A classical problem in comparative genomics is to compute the rearrangement distance, that is the minimum number of large-scale rearrangements required to transform a given genome into another given genome. While the most traditional approaches in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d637d4017f1ea6abc2a25a69144f5dbd
https://doi.org/10.21203/rs.3.rs-198423/v1
https://doi.org/10.21203/rs.3.rs-198423/v1
Linear programming is a key technique for analysis and verification of numerical properties in programs, neural networks, etc. In particular, in program analysis based on abstract interpretation, many numerical abstract domains (such as Template Cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bd35cb0a14f3b434f7cdf47d23ddd50
LIPIcs, Volume 144, ESA'19, Complete Volume
LIPIcs, Vol. 144, 27th Annual European Symposium on Algorithms (ESA 2019), pages 0-0
LIPIcs, Vol. 144, 27th Annual European Symposium on Algorithms (ESA 2019), pages 0-0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34a8b6b3f55835346da65632604b86fe
https://drops.dagstuhl.de/opus/volltexte/2019/11300/
https://drops.dagstuhl.de/opus/volltexte/2019/11300/