Publications related to Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

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

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

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

AC OPF in radial distribution networks – Part II: An augmented Lagrangian-based OPF algorithm, distributable via primal decomposition

Jean-Yves Le Boudec, Mario Paolone, Dan-Cristian Tomozei, Konstantina Christakou

In the first part of this two-part paper we show that the branch-flow convexification of the OPF problem is not exact and that the ADMM-based decomposition of the OPF fails to converge in specific scenarios. Therefore, there is a need to develop algorithms ...

Elsevier2017

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

We present an iterative retrieval algorithm based on data constraint for ultrashort pulse characterization using dispersion scan (d-scan). The proposed algorithm is much faster and leads to a drastic reduction of retrieval times, but, compared to the stand ...

Optical Society of America2017

Information Structure Design in Team Decision Problems

Maryam Kamgarpour, Tyler Summers

We consider a problem of information structure design in team decision problems and team games. We propose simple, scalable greedy algorithms for adding a set of extra information links to optimize team performance and resilience to non-cooperative and adv ...

2017

An Efficient Streaming Algorithm for the Submodular Cover Problem

Volkan Cevher, Ilija Bogunovic, Ya-Ping Hsieh, Ashkan Norouzi Fard, Abbas Bazzi, Marwa El Halabi

We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the stream wi ...

2016

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Divesh Aggarwal

We give a randomized 2^{n+o(n)}-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic O(4^n)-time and O(2^n)-space algorithm of Miccian ...

ACM2015

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Pascal Frossard

In free viewpoint video, a viewer can choose at will any camera angle or the so-called "virtual view" to observe a dynamic 3-D scene, enhancing his/her depth perception. The virtual view is synthesized using texture and depth videos of two anchor camera vi ...

2015

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Graph Chatbot

Chat with Graph Search

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

A Distributed Algorithm for Partitioned Robust Submodular Maximization

AC OPF in radial distribution networks – Part II: An augmented Lagrangian-based OPF algorithm, distributable via primal decomposition

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

Information Structure Design in Team Decision Problems

An Efficient Streaming Algorithm for the Submodular Cover Problem

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Centrality of trees for capacitated -center

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Information Structure Design in Team Decision Problems

An Efficient Streaming Algorithm for the Submodular Cover Problem

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

AC OPF in radial distribution networks – Part II: An augmented Lagrangian-based OPF algorithm, distributable via primal decomposition

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Centrality of trees for capacitated -center

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling