6 citations · 32 across the 37 of their papers we have counts for
11 papers · 1 filter
Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
Malleable scheduling is a model that captures the possibility of parallelization to expedite the completion of time-critical tasks. A malleable job can be allocated and processed s…
Label Ranking through Nonparametric Regression
Dimitris Fotakis, Alkis Kalavasis, Eleni Psaroudaki
Label Ranking (LR) corresponds to the problem of learning a hypothesis that maps features to rankings over a finite set of labels. We adopt a nonparametric regression approach to L…
Sampling Multiple Nodes in Large Networks: Beyond Random Walks
Omri Ben-Eliezer, Talya Eden, Joel Oren +1
Sampling random nodes is a fundamental algorithmic primitive in the analysis of massive networks, with many modern graph mining algorithms critically relying on it. We consider the…
Dimensionality, Coordination, and Robustness in Voting
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
We study the performance of voting mechanisms from a utilitarian standpoint, under the recently introduced framework of metric-distortion, offering new insights along three main li…
Efficient Algorithms for Learning from Coarse Labels
Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis +1
For many learning problems one may not have access to fine grained label information; e.g., an image can be labeled as husky, dog, or even animal depending on the expertise of the…
On the Approximability of Multistage Min-Sum Set Cover
Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos +2
We investigate the polynomial-time approximability of the multistage version of Min-Sum Set Cover (), a natural and intriguing generalization of the classical List U…