628 search results - page 90 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
113
Voted
WINE
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
120
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
139
Voted
CATS
2006
15 years 4 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
117
Voted
SIGECOM
2006
ACM
15 years 8 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
157
Voted
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...