
Correlation Clustering in Constant Many Parallel Rounds
Correlation clustering is a central topic in unsupervised learning, with...
read it

Deterministic (1+ε)Approximate Maximum Matching with 𝗉𝗈𝗅𝗒(1/ε) Passes in the SemiStreaming Model
We present a deterministic (1+ε)approximate maximum matching algorithm ...
read it

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
Interval scheduling is a basic problem in the theory of algorithms and a...
read it

Fairness in Streaming Submodular Maximization: Algorithms and Hardness
Submodular maximization has become established as the method of choice f...
read it

Online Page Migration with ML Advice
We consider online algorithms for the page migration problem that use pr...
read it

Fully Dynamic Algorithm for Constrained Submodular Optimization
The task of maximizing a monotone submodular function under a cardinalit...
read it

Massively Parallel Algorithms for Distance Approximation and Spanners
Over the past decade, there has been increasing interest in distributed/...
read it

Parallel Algorithms for Small Subgraph Counting
Subgraph counting is a fundamental problem in analyzing massive graphs, ...
read it

Improved Local Computation Algorithm for Set Cover via Sparsification
We design a Local Computation Algorithm (LCA) for the set cover problem....
read it

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Given a source of iid samples of edges of an input graph G with n vertic...
read it

Walking Randomly, Massively, and Efficiently
We introduce an approach that enables for efficiently generating many in...
read it

Adversarially Robust Submodular Maximization under Knapsack Constraints
We propose the first adversarially robust algorithm for monotone submodu...
read it

Identifying Maximal NonRedundant Integer Cone Generators
A nonredundant integer cone generator (NICG) of dimension d is a set S ...
read it

Weighted Matchings via Unweighted Augmentations
We design a generic method for reducing the task of finding weighted mat...
read it

Beyond 1/2Approximation for Submodular Maximization on Massive Data Streams
Many tasks in machine learning and data mining, such as data diversifica...
read it

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
We present O( n)round algorithms in the Massively Parallel Computation ...
read it

A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians
Sparsitybased methods are widely used in machine learning, statistics, ...
read it

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
We study the classical problem of maximizing a monotone submodular funct...
read it

Robust Submodular Maximization: A NonUniform Partitioning Approach
We study the problem of maximizing a monotone submodular function subjec...
read it
Slobodan Mitrović
is this you? claim profile