7 citations · 21 across the 14 of their papers we have counts for
6 papers · 1 filter
Weighted Matching in a Poly-Streaming Model
Ahammed Ullah, S. M. Ferdous, Alex Pothen
We introduce the poly-streaming model, a generalization of streaming models of computation in which processors process data streams containing a total of items. The alg…
Semi-Streaming Algorithms for Hypergraph Matching
Henrik Reinstädtler, S M Ferdous, Alex Pothen +2
We propose two one-pass streaming algorithms for the -hard hypergraph matching problem. The first algorithm stores a small subset of potential matching edges in a sta…
Semi-Streaming Algorithms for Weighted -Disjoint Matchings
S M Ferdous, Bhargav Samineni, Alex Pothen +2
We design and implement two single-pass semi-streaming algorithms for the maximum weight -disjoint matching (-DM) problem. Given an integer , the -DM problem is to find…
A Parallel Approximation Algorithm for Maximizing Submodular -Matching
S M Ferdous, Alex Pothen, Arif Khan +2
We design new serial and parallel approximation algorithms for computing a maximum weight -matching in an edge-weighted graph with a submodular objective function. This problem…
A 2/3-Approximation Algorithm for Vertex-weighted Matching
Ahmed Al-Herz, Alex Pothen
We consider the maximum vertex-weighted matching problem (MVM) for non-bipartite graphs. In earlier work we have described a 2/3-approximation algorithm for the MVM on bipartite gr…
A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite Graphs
Florin Dobrian, Mahantesh Halappanavar, Alex Pothen +1
We consider the maximum vertex-weighted matching problem (MVM), in which non-negative weights are assigned to the vertices of a graph, the weight of a matching is the sum of the we…