626 search results - page 52 / 126 » On Approximability of Minimum Bisection Problem |
136
Voted
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 2 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
143
click to vote
JCO
2006
15 years 2 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
140
Voted
WIOPT
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
156
Voted
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
145
Voted
NETWORKS
2002
15 years 2 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...