Two Examples of Distributed Architecture for Solving Combinatorial Optimization Problems

Authors:
S. M. Achasova
Affiliations:
-
Venue:
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Year:
1999

Citing 3
Cited 0

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
A primal-dual parallel approximation technique applied to weighted set and vertex covers

Journal of Algorithms
Parallel Substitution Algorithm: Theory and Application

Parallel Substitution Algorithm: Theory and Application

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the Parallel Substitution Algorithm, as a formal model of parallel computations, two examples of distributed architecture are given for implementation of fast parallel algorithms: for the maximal independent set problem and the minimum weighted vertex cover one.