49 citations · 67 across the 12 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DM2014★ 1 cited
Network installation and recovery: approximation lower bounds and faster exact formulations
Alexander Gutfraind, Jeremy Kun, Ádám D. Lelkes +1
We study the Neighbor Aided Network Installation Problem (NANIP) introduced previously which asks for a minimal cost ordering of the vertices of a graph, where the cost of visiting…
cs.CC2014★ 1 cited
On the Computational Complexity of MapReduce
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes +2
In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show…
cs.FL2014
Biclique coverings, rectifier networks and the cost of -removal
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György +2
We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number and the minimal rectifier network size of a b…