6 citations · 32 across the 37 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
On the Size and the Approximability of Minimum Temporally Connected Subgraphs
Kyriakos Axiotis, Dimitris Fotakis
We consider temporal graphs with discrete time labels and investigate the size and the approximability of minimum temporally connected spanning subgraphs. We present a family of mi…
cs.DS2016
Scheduling MapReduce Jobs under Multi-Round Precedences
Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos +2
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the ave…