The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one o...
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed sto...
Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, ...
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
This paper proposes a method for detecting instances of shape classes that exhibit variable structure. The term "variable structure" is used to characterize shape classes...
Vassilis Athitsos, Jingbin Wang, Stan Sclaroff, Ma...