121 search results - page 9 / 25 » Approximating Maximum Weight Matching in Near-Linear Time |
CISS
2008
IEEE
14 years 5 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
SPAA
1999
ACM
14 years 3 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
SSDBM
2007
IEEE
14 years 5 months ago
2007
IEEE
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...