82 search results - page 1 / 17 » Roundings Respecting Hard Constraints |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
SIAMSC
2008
13 years 4 months ago
2008
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
PVLDB
2010
13 years 3 months ago
2010
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
SPLC
2010
13 years 2 months ago
2010
Abstract. Feature modeling is a technique for capturing commonality and variability. Feature models symbolize a representation of the possible application configuration space, and ...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...