Masashi Kiyomi

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems

Finding a \emph{single} best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world problems as objective functions and constraints are only ``approximately'' formulated for original real-world problems. To so…