1941 search results - page 71 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
101
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
118
click to vote
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
MOBISYS
2007
ACM
15 years 9 months ago
2007
ACM
Ubiquitous connectivity on mobile devices will enable numerous new applications in healthcare and multimedia. We set out to check how close we are towards ubiquitous connectivity ...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...