369 search results - page 29 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
128
Voted
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
106
click to vote
SWAT
1994
Springer
15 years 6 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
105
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
113
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
129
click to vote
GD
2008
Springer
15 years 3 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...