306 search results - page 13 / 62 » Parallel approximation algorithms for facility-location prob... |
PPAM
2007
Springer
15 years 3 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 ...
ASIAN
1999
Springer
15 years 1 months ago
1999
Springer
81
Voted
DAM
2010
14 years 6 months ago
2010
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
SODA
2010
ACM
15 years 6 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...