Publications related to Some combinatorial optimization problems in graphs with applications in telecommunications and tomography

Improved Ramsey-type results for comparability graphs

Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if G is an n-vertex graph that is ...

CAMBRIDGE UNIV PRESS2020

Symbolic Algorithms for Token Swapping

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...

2020

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

Ramsey numbers of ordered graphs

Jan Kyncl

An ordered graph is a pair G = (G,

ELECTRONIC JOURNAL OF COMBINATORICS2020

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Maryam Kamgarpour, Tyler Summers, Baiwei Guo, Orcun Karaca

Actuator placement is an active field of research which has received significant attention for its applications in complex dynamical networks. In this paper, we study the problem of finding a set of actuator placements minimizing the metric that measures t ...

2020

Local approximation of the Maximum Cut in regular graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MAXCUT) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communica ...

ELSEVIER2020

Joint Graph-based Depth Refinement and Normal Estimation

Pascal Frossard, Mireille El Gheche, Mattia Rossi

Depth estimation is an essential component in understanding the 3D geometry of a scene, with numerous applications in urban and indoor settings. These scenes are characterized by a prevalence of human made structures, which in most of the cases, are either ...

2020

Braided rivers networks dynamics: analyzing topographic data from a large flume experiment

Christophe Ancey, Daniel Vito Papa

Braided rivers are highly dynamical systems characterized by varying network-like structures even under quasi-steady conditions. Understanding their dynamics is crucial in geomorphology and river engineering (e.g., river restoration in Alpine and piedmond ...

2020

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

Klaus Jansen, Lars Rohwedder

In the restricted Santa Claus problem we are given resources R and players P. Every resource j is an element of R. has a value v(j) and every player i is an element of P desires a set of resources R(i). We are interested in distributing the resources to pl ...

ELSEVIER2020

Learning Graph Influence From Social Interactions

Ali H. Sayed, Virginia Bordignon, Augusto José Rabelo Almeida Santos

In social learning, agents form their opinions or beliefs about certain hypotheses by exchanging local information. This work considers the recent paradigm of weak graphs, where the network is partitioned into sending and receiving components, with the for ...

IEEE2020

Some combinatorial optimization problems in graphs with applications in telecommunications and tomography

Graph Chatbot

Chat with Graph Search

Improved Ramsey-type results for comparability graphs

Symbolic Algorithms for Token Swapping

New Results in Integer and Lattice Programming

Ramsey numbers of ordered graphs

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Local approximation of the Maximum Cut in regular graphs

Joint Graph-based Depth Refinement and Normal Estimation

Braided rivers networks dynamics: analyzing topographic data from a large flume experiment

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

Learning Graph Influence From Social Interactions

Improved Ramsey-type results for comparability graphs

Ramsey numbers of ordered graphs

Braided rivers networks dynamics: analyzing topographic data from a large flume experiment

Local approximation of the Maximum Cut in regular graphs

New Results in Integer and Lattice Programming

Joint Graph-based Depth Refinement and Normal Estimation

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

Symbolic Algorithms for Token Swapping

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Learning Graph Influence From Social Interactions