Sciweavers

7006 search results - page 165 / 1402
» Approximation Algorithms
Sort
View
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 2 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
ECCC
2000
179views more  ECCC 2000»
15 years 2 months ago
A Note on Approximating MAX-BISECTION on Regular Graphs
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...
Uriel Feige, Marek Karpinski, Michael Langberg
IPL
2008
129views more  IPL 2008»
15 years 3 months ago
Parameterized approximation of dominating set problems
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
Rodney G. Downey, Michael R. Fellows, Catherine Mc...
MTA
2010
108views more  MTA 2010»
15 years 1 months ago
A reduced-reference structural similarity approximation for videos corrupted by channel errors
Abstract In this paper we propose a reduced-reference quality assessment algorithm which computes an approximation of the Structural SIMilarity (SSIM) metrics exploiting coding too...
Marco Tagliasacchi, Giuseppe Valenzise, Matteo Nac...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 9 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao