909 search results - page 40 / 182 » On the approximability of some network design problems |
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— In this paper, we study the survivability problem in hierarchical wireless access networks with dual-homed end users, who are connected to two base stations (BSs), a primary BS...
106
click to vote
WIOPT
2010
IEEE
14 years 12 months ago
2010
IEEE
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...
113
click to vote
MP
2007
15 years 1 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
164
click to vote
STOC
1998
ACM
15 years 5 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
119
Voted
PPAM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. 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 algorit...