369 search results - page 5 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
94
Voted
PPAM
2007
Springer
15 years 5 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 ...
121
click to vote
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
122
click to vote
STOC
2009
ACM
16 years 8 days ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
WG
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
74
Voted
ORL
2007
14 years 11 months ago
2007