Publications related to Clique problem

A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

The objective of uncertainty quantification is to certify that a given physical, engineering or economic system satisfies multiple safety conditions with high probability. A more ambitious goal is to actively influence the system so as to guarantee and mai ...

Springer Verlag2015

Maximizing Symmetric Submodular Functions

Moran Feldman

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. In this work, we identify submodular maximization problems for which one can get a better app ...

Springer Int Publishing Ag2015

Pliable Index Coding

Christina Fragouli, Siddhartha Brahma

We formulate a new variant of the index coding problem, where instead of demanding a specific message, clients are pliable, and are interested in receiving any t messages that they do not have. We term this problem pliable index coding or PICOD(t). We prov ...

Ieee-Inst Electrical Electronics Engineers Inc2015

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

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Bartosz Maria Walczak, Michal Lason

A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line L if the intersection of any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of com ...

Springer2014

Coloring Relatives of Interval Overlap Graphs via On-line Games

Bartosz Maria Walczak

The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs defined by geometric representations and competitivity analysis of on-line algorithms. This connection became apparent after the recent construction ...

Springer-Verlag Berlin2014

Triangle-free intersection graphs of line segments with large chromatic number

Bartosz Maria Walczak, Michal Lason

In the 1970s Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no. Specifically, for each positive integer k we construct a triangle-free fam ...

Academic Press Inc Elsevier Science2014

Multi-Objective Airport Gate Assignment Problem in Planning and Operations

Michel Bierlaire, Prem Kumar

We consider the assignment of gates to arriving and departing flights at a large hub airport. This problem is highly complex even in planning stage when all flight arrivals and departures are assumed to be known precisely in advance. There are various cons ...

Wiley-Blackwell2014

MATHICSE Technical Report : Tensor train approximation of moment equations for the log-normal Darcy problem

Fabio Nobile, Daniel Kressner, Francesca Bonizzoni

We study the Darcy problem with log-normal permeability, modeling the fluid flow in a heterogeneous porous medium. A perturbation approach is adopted, expanding the solution in Taylor series around the nominal value of the permeability. The resulting recur ...

MATHICSE2014

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Clique problem

A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming

Maximizing Symmetric Submodular Functions

Pliable Index Coding

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

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Coloring Relatives of Interval Overlap Graphs via On-line Games

Triangle-free intersection graphs of line segments with large chromatic number

Multi-Objective Airport Gate Assignment Problem in Planning and Operations

MATHICSE Technical Report : Tensor train approximation of moment equations for the log-normal Darcy problem

Ramsey-type results for semi-algebraic relations

Graph Chatbot

Chat with Graph Search

A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming

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

Pliable Index Coding

MATHICSE Technical Report : Tensor train approximation of moment equations for the log-normal Darcy problem

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Maximizing Symmetric Submodular Functions

Coloring Relatives of Interval Overlap Graphs via On-line Games

Triangle-free intersection graphs of line segments with large chromatic number

Multi-Objective Airport Gate Assignment Problem in Planning and Operations

Ramsey-type results for semi-algebraic relations