350 search results - page 16 / 70 » Lower bounds and heuristic algorithms for the k |
163
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
186
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
172
click to vote
DATE
2000
IEEE
15 years 10 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
136
click to vote
AAECC
2006
Springer
16 years 21 days ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
167
click to vote
IJMC
2006
15 years 6 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...