Publications related to Approximation algorithms for geometric dispersion

Improved hardness results for unique shortest vector problem

The unique shortest vector problem on a rational lattice is the problem of finding the shortest non-zero vector under the promise that it is unique (up to multiplication by -1). We give several incremental improvements on the known hardness of the unique s ...

Elsevier2016

Submodular Stochastic Probing on Matroids

Justin Dean Ward, Marek Adamczyk

In a stochastic probing problem we are given a universe E, and a probability that each element e in E is active. We determine if an element is active by probing it, and whenever a probed element is active, we must permanently include it in our solution. Mo ...

INFORMS2016

Maximizing k-Submodular Functions and Beyond

Justin Dean Ward

We consider the maximization problem in the value oracle model of functions defined on k-tuples of sets that are submodular in every orthant and r-wise monotone, where k >= 2 and 1

Assoc Computing Machinery2016

Fast K-Means with Accurate Bounds

François Fleuret, James Peter Newling

We propose a novel accelerated exact

k

-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3

\times

faster. We also propose a general improvement of existing state-of-the-art a ...

Idiap2016

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

Obstacles For Splitting Multidimensional Necklaces

Michal Lason

The well-known "necklace splitting theorem" of Alon (1987) asserts that every k-colored necklace can be fairly split into q parts using at most t cuts, provided k(q - 1)

Amer Mathematical Soc2015

Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees

Hervé Bourlard, Philip Neil Garner, Afsaneh Asaei, Mohammadjavad Taghizadeh, Reza Parhizkar

This paper addresses the problem of ad hoc microphone array calibration where only partial information about the distances between the microphones is available. We construct a matrix consisting of the pairwise distances and propose to estimate the missing ...

2015

Relax and Unfold: Microphone Localization with Euclidean Distance Matrices

Martin Vetterli, Ivan Dokmanic, Juri Ranieri

Recent methods for localization of microphones in a microphone array exploit sound sources at a priori unknown locations. This is convenient for ad-hoc arrays, as it requires little additional infrastructure. We propose a flexible localization algorithm by ...

2015

Euclidean Distance Matrices: Essential Theory, Algorithms and Applications

Martin Vetterli, Ivan Dokmanic, Juri Ranieri, Reza Parhizkar

Euclidean distance matrices (EDMs) are matrices of the squared distances between points. The definition is deceivingly simple; thanks to their many useful properties, they have found applications in psychometrics, crystallography, machine learning, wireles ...

2015

Approximation algorithms for geometric dispersion

Graph Chatbot

Chat with Graph Search

Improved hardness results for unique shortest vector problem

Submodular Stochastic Probing on Matroids

Maximizing k-Submodular Functions and Beyond

Fast K-Means with Accurate Bounds

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Centrality of trees for capacitated -center

Obstacles For Splitting Multidimensional Necklaces

Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees

Relax and Unfold: Microphone Localization with Euclidean Distance Matrices

Euclidean Distance Matrices: Essential Theory, Algorithms and Applications

Maximizing k-Submodular Functions and Beyond

Improved hardness results for unique shortest vector problem

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Centrality of trees for capacitated -center

Fast K-Means with Accurate Bounds

Relax and Unfold: Microphone Localization with Euclidean Distance Matrices

Euclidean Distance Matrices: Essential Theory, Algorithms and Applications

Submodular Stochastic Probing on Matroids

Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees

Obstacles For Splitting Multidimensional Necklaces