Shiro Ikeda
Shiro Ikeda
About
News
Projects
Talks
Publications
CV
Contact
Light
Dark
Automatic
"optimization"
Maximum-expectation matching under recourse
This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that upon failure, remaining vertices that have not been matched may be subject to a new assignment. …
Cite
×