7930 search results - page 278 / 1586 » Greedy in Approximation Algorithms |
170
click to vote
SIAMDM
2000
15 years 6 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
166
click to vote
WADS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
170
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
215
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
185
click to vote
ISAAC
2000
Springer
15 years 10 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...