1951 search results - page 108 / 391 » An algorithm for improving graph partitions |
138
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
153
click to vote
ICCAD
2009
IEEE
15 years 2 months ago
2009
IEEE
Hardware acceleration is crucial in modern embedded system design to meet the explosive demands on performance and cost. Selected computation kernels for acceleration are usually ...
135
click to vote
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
126
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
136
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...