Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Power of human-algorithm collaboration in solving combinatorial optimization problems
Tapani Toivonen
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such problem is maximum clique which -- under standard…
cs.DS2019
Constant factor approximation of MAX CLIQUE
Tapani Toivonen, Janne Karttunen
MAX CLIQUE problem (MCP) is an NPO problem, which asks to find the largest complete sub-graph in a graph (directed or undirected). MCP is well known to be …