1429 search results - page 66 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
ECCC
2000
13 years 9 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
ICIP
2005
IEEE
14 years 11 months ago
2005
IEEE
For video communications over wireless ad hoc networks, multiple paths with limited bandwidth are common. It therefore presents new challenges to the video encoding. In this paper...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
FSTTCS
1993
Springer
14 years 1 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...