152 search results - page 12 / 31 » Solving hard instances of floorplacement |
CP
2005
Springer
14 years 27 days ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
ALENEX
2007
13 years 8 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
JCO
2010
13 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
ANOR
2004
13 years 7 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...