Publications associées à Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

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.

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

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

Graph Chatbot

Chattez avec Graph Search

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

Covering convex bodies and the Closest Vector Problem

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Faster Algorithms for Integer Programs with Block Structure

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits

Robust auction design under multiple priors by linear and integer programming

Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels with Feedback

Optimal Representations for Adaptive Streaming in Interactive Multiview Video Systems

On some algebraic and extremal problems in discrete geometry

Strengths and Limitations of Linear Programming Relaxations

Strengths and Limitations of Linear Programming Relaxations

Faster Algorithms for Integer Programs with Block Structure

Robust auction design under multiple priors by linear and integer programming

Optimal Representations for Adaptive Streaming in Interactive Multiview Video Systems

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits

On some algebraic and extremal problems in discrete geometry

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

Covering convex bodies and the Closest Vector Problem

Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels with Feedback