534 search results - page 91 / 107 » Tight approximation algorithm for connectivity augmentation ... |
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
ALENEX
2009
13 years 8 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...