Publications by Slobodan Mitrovic

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Mikhail Kapralov, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakab Tardos

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

ASSOC COMPUTING MACHINERY2020

Weighted Matchings via Unweighted Augmentations

Ola Nils Anders Svensson, Slobodan Mitrovic, Buddhima Ruwanmini Gamlath Gamlath Ralalage

We design a generic method to reduce the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method enables us to provide efficient implementations for approximating weighted matchings in the massively pa ...

ASSOC COMPUTING MACHINERY2019

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Slobodan Mitrovic, Mohsen Ghaffari

We present O(log log n)-round algorithms in the Massively Parallel Computation (MPC) model, with a(n) memory per machine, that compute a maximal independent set, a 1 + epsilon approximation of maximum matching, and a 2 + epsilon approximation of minimum ve ...

ASSOC COMPUTING MACHINERY2018

Round Compression for Parallel Matching Algorithms

Slobodan Mitrovic, Aleksander Madry

For over a decade now we have been witnessing the success of massive parallel computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to accurately capture th ...

ASSOC COMPUTING MACHINERY2018

When Stuck, Flip a Coin

Slobodan Mitrovic

Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question: How can we design efficient algorithms for large-scale computation? In this thesis, we focus on devising a general strategy to addr ...

EPFL2018

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Volkan Cevher, Ilija Bogunovic, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakub Tarnawski

We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fashion and (ii) m items from the algorithm’s memory might be removed after th ...

2017

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

Abstract—In this paper, we consider the problem of maximizing a monotone submodular function subject to a cardinality constraint, with two added twists: The computation is distributed across a number of machines, and we require the solution to be robust ag ...

2017

Homometric sets in trees

Radoslav Fulek, Slobodan Mitrovic

Let G = (V, E) denote a simple graph with vertex set V and edge set E. The profile of a vertex set V' subset of V denotes the multiset of pairwise distances between the vertices of V'. Two disjoint subsets of V are homometric if their profiles are the same ...

Academic Press Ltd- Elsevier Science Ltd2014

Coupled tomography and distinct-element-method approach to exploring the granular media microstructure in a jamming hourglass

Giorgio Margaritondo, Michaël Unser, Thomas Liebling, Daniel Sage, Lionel Pournin, Slobodan Mitrovic, Marco Ramaioli, Michel Tsukahara, Vincent Gajdosik

We describe an approach for exploring microscopic properties of granular media that couples x-ray microtomography and distinct-element-method (DEM) simulations through image analysis. We illustrate it via the study of the intriguing phenomenon of instant a ...

APS2008

Slobodan Mitrovic

Graph Chatbot

Chat with Graph Search

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Weighted Matchings via Unweighted Augmentations

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Round Compression for Parallel Matching Algorithms

When Stuck, Flip a Coin

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Homometric sets in trees

Coupled tomography and distinct-element-method approach to exploring the granular media microstructure in a jamming hourglass

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Weighted Matchings via Unweighted Augmentations

Homometric sets in trees

Round Compression for Parallel Matching Algorithms

When Stuck, Flip a Coin

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Coupled tomography and distinct-element-method approach to exploring the granular media microstructure in a jamming hourglass

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach