3 papers
cs.DS2023
The Minimum Clique Routing Problem on Cycles
Mariana Escalante, Martín Matamala, Iván Rapaport +2
In the Minimum Clique Routing Problem on Cycles \textsc{MCRPC} we are given a cycle together with a set of demands (weighted origin-destination pairs) and the goal is to route all…
math.CO2016
Lovász-Schrijver PSD-operator on Claw-Free Graphs
Silvia Bianchi, Mariana Escalante, Graciela Nasini +1
The subject of this work is the study of $\LS_+$-perfect graphs defined as those graphs for which the stable set polytope $\stab(G)$ is achieved in one iteration of Lovász-Schr…
cs.DM2014
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
S. Bianchi, M. Escalante, G. Nasini +1
We study the Lovász-Schrijver lift-and-project operator () based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of gr…