Sciweavers

740 search results - page 18 / 148
» An approximation ratio for biclustering
Sort
View
120
Voted
MP
2010
172views more  MP 2010»
15 years 9 days ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
119
Voted
ALGOSENSORS
2010
Springer
15 years 26 days ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker
137
Voted
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
15 years 5 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
TSP
2012
13 years 9 months ago
Optimized Compact-Support Interpolation Kernels
Abstract—In this paper, we investigate the problem of designing compact-support interpolation kernels for a given class of signals. By using calculus of variations, we simplify t...
Ramtin Madani, Ali Ayremlou, Arash Amini, Farrokh ...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 7 days ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer