523 search results - page 26 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
APCSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
SWAT
2004
Springer
14 years 29 days ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
DC
2011
12 years 7 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...