Publication

Approximation Algorithms for Allocation and Network Design

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Publications associées à Approximation Algorithms for Allocation and Network Design | EPFL Graph Search

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 Allocation and Network Design

Graph Chatbot

Chattez avec Graph Search

Knapsack and Subset Sum with Small Items

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

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

Online Contention Resolution Schemes With Applications To Bayesian Selection Problems

New Results in Integer and Lattice Programming

A note on the integrality gap of the configuration LP for restricted Santa Claus

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

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

Interpolatory Rational Model Order Reduction of Parametric Problems Lacking Uniform Inf-Sup Stability

Fully dynamic bin packing revisited

New Results in Integer and Lattice Programming

Fully dynamic bin packing revisited

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

Knapsack and Subset Sum with Small Items

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

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

Online Contention Resolution Schemes With Applications To Bayesian Selection Problems

A note on the integrality gap of the configuration LP for restricted Santa Claus

Interpolatory Rational Model Order Reduction of Parametric Problems Lacking Uniform Inf-Sup Stability

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