Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets
- 作者M. Yu. Khachai
- 卷第18卷
- 期第2期
- 印刷ISSN1054-6618
- 电子ISSN1555-6212
- 文件大小171.59KB
- 发表时间2008-06
- DOI10.1134/s1054661808020089
- 页码236-242
Modification of simple beat tracking algorithmM. Yu. Khachai; K. S. Kobylkin; D. M. Khachai · 2011
Modification of the algorithm for beat tracking of a musical melodyM. Yu. Khachai, K. S. Kobylkin, D. M. Khachai · 2013
Ivan Ivanovich EreminBerdyshev, V. I.; Vasin, V. V.; Matveev, S. V.; Makhnev, A. A.; Subbotin, Yu. N.; Subbotina, N. N.; Ushakov, V. N.; Khachai, M. Yu.; Chentsov, A. G. · Proceedings of the Steklov Institute of Mathematics · 2015
Parallel computations and committee constructionsV. D. Mazurov; M. Yu. Khachai · 2007
Committees of Systems of Linear InequalitiesV. D. Mazurov; M. Yu. Khachai · 2004
On the existence of majority committeeKHACHAI, M. YU. · Discrete Mathematics and Applications · 1997
Structure of boundary layers in singular problemsA. M. Il’in, O. Yu. Khachai · 2012
Polynomial-Time Approximation Scheme for the Capacitated Vehicle Routing Problem with Time WindowsKhachai, M. Yu.; Ogorodnikov, Yu. Yu. · Proceedings of the Steklov Institute of Mathematics · 2019