Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Beskrivning
Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms.
Takuro Fukunaga is currently a project associate professor at the National Institute of Informatics. After receiving a B.A. in engineering and an M.A. and Ph.D. in informatics from Kyoto University in 2003, 2005, and 2007, respectively, he was an assistant professor there until January 2013. He is a member of the Operations Research Society of Japan, the Information Processing Society of Japan, and IEEE.Ken-ichi Kawarabayashi is a professor at the National Institute of Informatics. He received a B.A., M.A., and Ph.D. from Keio University in 1998, 2000, and 2001, respectively. The prizes he has been awarded include the IBM Japanese Science Prize, the JSPS Prize 2013, the Japan Academy Medal in 2013, the SODA best paper award in 2013, and the Mathematics Annual Spring Prize in 2015.
Innehållsförteckning
Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems.- Graph Stabilization: A Survey.- Spider Covering Algorithms for Network Design problems.- Discrete Convex Functions on Graphs and Their Algorithmic Applications.- Parameterized Complexity of the Workflow Satisfiability Problem.