Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Satoshi Takabe

Showing results (1-10 of 4) with videos related to

Pageof 1
Sort By:
Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics|July 15, 2014
Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithmSatoshi Takabe, Koji Hukushima
Physical Review. E|June 15, 2016
Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problemsSatoshi Takabe, Koji Hukushima
Physical Review. E|March 18, 2018
Typical approximation performance for maximum coverage problemSatoshi Takabe, Takanori Maehara, Koji Hukushima
Physical Review. E|June 20, 2019
Fault tolerance of random graphs with respect to connectivity: Mean-field approximation for semidense random graphsSatoshi Takabe, Takafumi Nakano, Tadashi Wadayama
Pageof 1

Showing results (1-10 of 4) with videos related to

Sort By:
Pageof 1
Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics|July 15, 2014
Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithmSatoshi Takabe, Koji Hukushima
Physical Review. E|June 15, 2016
Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problemsSatoshi Takabe, Koji Hukushima
Physical Review. E|March 18, 2018
Typical approximation performance for maximum coverage problemSatoshi Takabe, Takanori Maehara, Koji Hukushima
Physical Review. E|June 20, 2019
Fault tolerance of random graphs with respect to connectivity: Mean-field approximation for semidense random graphsSatoshi Takabe, Takafumi Nakano, Tadashi Wadayama
Pageof 1