Publications related to Nested Convex Bodies are Chaseable

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

Algorithms For Clustering Problems

Ashkan Norouzi Fard

Clustering is a classic topic in combinatorial optimization and plays a central role in many areas, including data science and machine learning. In this thesis, we first focus on the dynamic facility location problem (i.e., the facility location problem in ...

EPFL2018

On some problems related to 2-level polytopes

Manuel Francesco Aprile

In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...

EPFL2018

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

LP-Based Algorithms For Capacitated Facility Location

Ola Nils Anders Svensson, Hyung Chan An

Linear programming (LP) has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic me ...

Society for Industrial and Applied Mathematics2017

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

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Nikolaos Geroliminis, Jack Haddad, Mohammadreza Hajiahmadi

Since centralized control of urban networks with detailed modeling approaches is computationally complex, developing efficient hierarchical control strategies based on aggregate modeling is of great importance. The dynamics of a heterogeneous large-scale u ...

Institute of Electrical and Electronics Engineers2015

Linear Growth for Certain Elliptic Fibrations

Pierre Francis André Le Boudec

We prove that the number of rational points of bounded height on certain del Pezzo surfaces of degree 1 defined over Q grows linearly, as predicted by Manin's conjecture. ...

Oxford University Press2015

The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ_1

Nisheeth Vishnoi

In this article, we disprove a conjecture of Goemans and Linial; namely, that every negative type metric embeds into ℓ1 with constant distortion. We show that for an arbitrarily small constant δ > 0, for all large enough n, there is an n-point negative ...

Association for Computing Machinery2015

LP-Based Algorithms for Capacitated Facility Location

Ola Nils Anders Svensson, Hyung Chan An

Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic methodo ...

IEEE2014

Nested Convex Bodies are Chaseable

Graph Chatbot

Chat with Graph Search

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Algorithms For Clustering Problems

On some problems related to 2-level polytopes

Dynamic Facility Location via Exponential Clocks

LP-Based Algorithms For Capacitated Facility Location

On some algebraic and extremal problems in discrete geometry

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Linear Growth for Certain Elliptic Fibrations

The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ_1

LP-Based Algorithms for Capacitated Facility Location

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

On some problems related to 2-level polytopes

Dynamic Facility Location via Exponential Clocks

LP-Based Algorithms For Capacitated Facility Location

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

On some algebraic and extremal problems in discrete geometry

LP-Based Algorithms for Capacitated Facility Location

The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ_1

Algorithms For Clustering Problems

Linear Growth for Certain Elliptic Fibrations