572 search results - page 22 / 115 » Exponential-Time Approximation of Hard Problems |
166
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
HEURISTICS
2006
14 years 10 months ago
2006
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...