163 search results - page 23 / 33 » Approximate bidding algorithms for a distributed combinatori... |
CP
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
PPAM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
SPAA
2004
ACM
14 years 23 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...