603 search results - page 41 / 121 » A General Approximation Technique for Constrained Forest Pro... |
124
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
128
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
114
click to vote
IPSN
2009
Springer
15 years 8 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
106
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
102
click to vote
FSTTCS
2001
Springer
15 years 6 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...