Zobrazeno 1 - 10
of 5 233
pro vyhledávání: '"Pseudo-polynomial time"'
Autor:
Bourhis, Pierre, Duchien, Laurence, Dusart, Jérémie, Lonca, Emmanuel, Marquis, Pierre, Quinton, Clément
We are interested in computing $k$ most preferred models of a given d-DNNF circuit $C$, where the preference relation is based on an algebraic structure called a monotone, totally ordered, semigroup $(K, \otimes, <)$. In our setting, every literal in
Externí odkaz:
http://arxiv.org/abs/2202.05938
Autor:
Pashkovich, Kanstantsin1 (AUTHOR) kpashkov@uottawa.ca
Publikováno v:
Mathematical Programming. Sep2022, Vol. 195 Issue 1/2, p1123-1133. 11p.
Autor:
Mizuta, Rei
We consider about calculating $M$th moments of a given polynomial in free independent semicircular elements in free probability theory. By a naive approach, this calculation requires exponential time with respect to $M$. We explicitly give an algorit
Externí odkaz:
http://arxiv.org/abs/1901.08210
Autor:
Pashkovich, Kanstantsin
We provide an algorithm for computing the nucleolus for an instance of a weighted voting game in pseudo-polynomial time. This resolves an open question posed by Elkind. et.al. 2007.
Externí odkaz:
http://arxiv.org/abs/1810.02670
In the weighted flow-time problem on a single machine, we are given a set of n jobs, where each job has a processing requirement p_j, release date r_j and weight w_j. The goal is to find a preemptive schedule which minimizes the sum of weighted flow-
Externí odkaz:
http://arxiv.org/abs/1802.07439
We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization. Here we are given a set of axis-parallel rectangles in the two-dimensional plane and the goal is to pack them in a vertical
Externí odkaz:
http://arxiv.org/abs/1801.07541
Publikováno v:
In Discrete Applied Mathematics 30 January 2019 253:103-121
Publikováno v:
In European Journal of Operational Research 1 January 2019 272(1):24-31
Publikováno v:
Proceedings of ICALP 2015, Lecture Notes in Computer Science vol. 9135, pp. 260--272, Springer
We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the latter whose running time is exponential only in the dimension, but not in th
Externí odkaz:
http://arxiv.org/abs/1502.06875
Autor:
Wang, Shuaian
Publikováno v:
In European Journal of Operational Research 1 April 2016 250(1):46-55