39 citations · 96 across the 32 of their papers we have counts for
4 papers · 1 filter
Approximate Bipartite -Matching using Multiplicative Auction
Bhargav Samineni, S M Ferdous, Mahantesh Halappanavar +1
Given a bipartite graph with vertices and edges and a function , a -matching is a subset of edges such that every verte…
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 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…