497 search results - page 2 / 100 » Approximating max-min linear programs with local algorithms |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study bandwidth allocation in multi-channel multihop wire...
TCBB
2011
13 years 16 days ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
SIAMCOMP
2010
13 years 4 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...