291 search results - page 17 / 59 » Constraint Satisfaction: The Approximability of Minimization... |
TALG
2010
13 years 6 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
SIAMCOMP
2008
13 years 7 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
VLSID
2007
IEEE
14 years 8 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
IFIPTCS
2010
13 years 5 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...