Mmke Tobias

Tobias Mmke

Information about the author Tobias Mmke will soon be added to the site.
Found 3 papers in total
Complexity and Approximability of Parameterized MAX-CSPs
Complexity and Approximability of Parameterized MAX-CSPs
2017
We study the optimization version of constraint satisfaction problems...
Reoptimization of the Shortest Common Superstring Problem
Reoptimization of the Shortest Common Superstring Problem
2011
A reoptimization problem describes the following scenario: given an instance of an...
Job shop scheduling with unit length tasks: bounds and algorithms
Job shop scheduling with unit length tasks: bounds and algorithms
2007
We consider the job shop scheduling problem unit–J m , where each job is...
Papers per page: