3 citations · 3 across the 3 of their papers we have counts for
4 papers
Accelerated Relax-and-Round for Concave Coverage Problems
Matthew Fahrbach, Mehraneh Liaee, Morteza Zadimoghaddam
We present an accelerated relax-and-round algorithm for concave coverage problems, which generalize the classic maximum coverage problem. Building on the relax-and-round framework…
Online Paging with Heterogeneous Cache Slots
Marek Chrobak, Samuel Haney, Mehraneh Liaee +4
It is natural to generalize the online -Server problem by allowing each request to specify not only a point , but also a subset of servers that may serve it. For uniform…
Retracting Graphs to Cycles
Samuel Haney, Mehraneh Liaee, Bruce M. Maggs +3
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum…
Information Spreading in Dynamic Networks under Oblivious Adversaries
John Augustine, Chen Avin, Mehraneh Liaee +2
We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always…