3 papers
cs.DS2024
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…
cs.DS2023
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…
cs.DS2022
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput
Baruch Schieber, Bhargav Samineni, Soroush Vahidi
Motivated by baterryless IoT devices, we consider the following scheduling problem. The input includes unit time jobs , where each job …