Zobrazeno 1 - 10
of 249
pro vyhledávání: '"Kazuo Iwama"'
Publikováno v:
Algorithms, Vol 6, Iss 2, Pp 371-382 (2013)
In the stable marriage problem, any instance admits the so-called man-optimal stable matching, in which every man is assigned the best possible partner. However, there are instances for which all men receive low-ranked partners even in the man-optima
Externí odkaz:
https://doaj.org/article/276bb321c26c40e2bdc59a24b41698bc
Publikováno v:
Algorithms, Vol 1, Iss 1, Pp 30-42 (2008)
We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5897. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose
Externí odkaz:
https://doaj.org/article/4ac8d0825cad476fb5f0c0540cdaebca
Autor:
Kazuo Iwama
Publikováno v:
Algorithms, Vol 7, Iss 2, Pp 188-188 (2014)
It has come to our attention that due to an error in producing the PDF version of the paper [1], doi:10.3390/a7010166, website: http://www.mdpi.com/1999-4893/7/1/166, Figures 1 and 9 are displayed incorrectly.
Externí odkaz:
https://doaj.org/article/a930dcc9335543669a2e1af68c083b2b
Autor:
Kazuo Iwama
Publikováno v:
Algorithms, Vol 1, Iss 1, Pp 1-1 (2008)
n/a
Externí odkaz:
https://doaj.org/article/6f974c71df9942548c95078dfb4421be
Publikováno v:
Theoretical Computer Science. 938:86-96
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07580ac36a776137b75333dbf6c432b1
https://doi.org/10.1016/j.tcs.2022.10.010
https://doi.org/10.1016/j.tcs.2022.10.010
Autor:
Kazuo Iwama, Mike Paterson
Publikováno v:
The American Mathematical Monthly. 129:303-319
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64793358f6d78337298739f6e8dfdb14
https://doi.org/10.1080/00029890.2022.2026166
https://doi.org/10.1080/00029890.2022.2026166
Autor:
Atsuki Nagao, Kazuo Iwama
Publikováno v:
ACM Transactions on Computation Theory. 11:1-12
Toward the ultimate goal of separating L and P , Cook, McKenzie, Wehr, Braverman, and Santhanam introduced the Tree Evaluation Problem ( TEP ). For fixed integers h and k > 0, FT h ( k ) is given as a complete, rooted binary tree of height h , in whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::559e01bc32ff6cab9e67de50ee798ec9
https://doi.org/10.1145/3282433
https://doi.org/10.1145/3282433
Autor:
Kazuo Iwama, Yuichi Yoshida
Publikováno v:
ACM Transactions on Computation Theory. 9:1-16
This article studies property testing for NP optimization problems with parameter k under the general graph model with an augmentation of random edge sampling capability. It is shown that a variety of such problems, including k -Vertex Cover, k -Feed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d74386958c93cee7d02f5018b99d2c0
https://doi.org/10.1145/3155294
https://doi.org/10.1145/3155294
Publikováno v:
Information and Computation. 249:110-120
In this paper we establish an algorithmic framework between bin packing and strip packing, with which strip packing can be very well approximated by applying some bin packing algorithms. More precisely we obtain the following results: (1) Any off-lin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d90bc6c22926bc238b7c541c856ad2d
https://doi.org/10.1016/j.ic.2016.03.010
https://doi.org/10.1016/j.ic.2016.03.010
Autor:
Rudy Raymond, Seiichiro Tani, Andris Ambainis, Shigeru Yamashita, Masaki Nakanishi, Harumichi Nishimura, Kazuo Iwama
Publikováno v:
computational complexity. 25:723-735
This paper considers the quantum query complexity of almost all functions in the set $${\mathcal{F}}_{N,M}$$FN,M of $${N}$$N-variable Boolean functions with on-set size $${M (1\le M \le 2^{N}/2)}$$M(1≤M≤2N/2), where the on-set size is the number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9bad422e9dcd44a0000adcb2985449c3
https://doi.org/10.1007/s00037-016-0139-6
https://doi.org/10.1007/s00037-016-0139-6