144 search results - page 24 / 29 » Improved Approximation Algorithms for Metric Max TSP |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
ICMCS
2009
IEEE
13 years 5 months ago
2009
IEEE
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...