115 search results - page 7 / 23 » Bounds on the Number of Maximal Sum-Free Sets |
WEA
2005
Springer
14 years 28 days ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
TSP
2010
13 years 2 months ago
2010
Abstract--This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative ...
CP
2001
Springer
13 years 12 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
—In distributed network settings, where nodes are not under the control of a single administrative entity, the fulfillment of fundamental network operations is heavily dependent...