5889 search results - page 258 / 1178 » Graph Layout Problems |
183
click to vote
ENTCS
2008
15 years 7 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
197
click to vote
IANDC
2007
15 years 7 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
189
click to vote
HEURISTICS
2010
15 years 1 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
232
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
193
Voted
WADS
2005
Springer
16 years 17 days ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...