296 search results - page 53 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
111
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
90
Voted
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...