628 search results - page 98 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
114
Voted
EWSN
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
133
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
126
Voted
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
118
Voted
FUIN
2006
15 years 2 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
ICCAD
2006
IEEE
15 years 11 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...