2 citations · 3 across the 2 of their papers we have counts for
2 papers
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.LG2014★ 2 cited
Locally Boosted Graph Aggregation for Community Detection
Jeremy Kun, Rajmonda Caceres, Kevin Carter
Learning the right graph representation from noisy, multi-source data has garnered significant interest in recent years. A central tenet of this problem is relational learning. Her…