Message Passing for Maximum Weight Independent Set
نویسندگان
چکیده
منابع مشابه
Message Passing for Max-weight Independent Set
We investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of loopy max-product belief propagation. We show that, if it converges, the quality of the estimate is closely related to the tightness of an LP relaxation of the MWIS problem. We use this relationship to obtain sufficient conditions f...
متن کاملClustering Aggregation as Maximum-Weight Independent Set
We formulate clustering aggregation as a special instance of Maximum-Weight Independent Set (MWIS) problem. For a given dataset, an attributed graph is constructed from the union of the input clusterings generated by different underlying clustering algorithms with different parameters. The vertices, which represent the distinct clusters, are weighted by an internal index measuring both cohesion...
متن کاملSegmentation as Maximum-Weight Independent Set
Given an ensemble of distinct, low-level segmentations of an image, our goal is to identify visually “meaningful” segments in the ensemble. Knowledge about any specific objects and surfaces present in the image is not available. The selection of image regions occupied by objects is formalized as the maximum-weight independent set (MWIS) problem. MWIS is the heaviest subset of mutually non-adjac...
متن کاملOptimistic Message Logging for Independent Checkpointing in Message-Passing Systems
Message-passing systems with communication protocol transparent to the applications typically require message logging to ensure consistency between checkpoints. This paper describes a periodic independent checkpointing scheme with optimistic logging to reduce performance degradation during normal execution while keeping the recovery cost acceptable. Both time and space overhead for message logg...
متن کاملHybrid Heuristic for the Maximum-Weight Independent Set Problem
We propose an approximate algorithm for finding the maximum-weight independent set of a given graph of n nodes with associated weights. It combines three different heuristics, and its running time is O(n2) in the practice. We also propose a set of random graphs for testing and comparing the maximumweight independent set algorithms. This graphs are easy to identically generate on any computer ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2009
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2009.2030448