Publications associées à Approximation algorithms for geometric dispersion

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Approximation algorithms for geometric dispersion

Graph Chatbot

Chattez avec Graph Search

Blind as a bat: spatial perception without sight

Online Contention Resolution Schemes With Applications To Bayesian Selection Problems

Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid

New Results in Integer and Lattice Programming

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

UCLID-Net: Single View Reconstruction in Object Space

Coordinate Difference Matrices

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid

New Results in Integer and Lattice Programming

Online Contention Resolution Schemes With Applications To Bayesian Selection Problems

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

UCLID-Net: Single View Reconstruction in Object Space

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Blind as a bat: spatial perception without sight

Coordinate Difference Matrices

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness