Related papers: On the Tree Augmentation Problem
We are interested in the consequences of imposing edges in $T$ a minimum spanning tree. We prove that the sum of the replacement costs in $T$ of the imposed edges is a lower bounds of the additional costs. More precisely if r-cost$(T,e)$ is…
In this paper, we study the $k$-forest problem in the model of resource augmentation. In the $k$-forest problem, given an edge-weighted graph $G(V,E)$, a parameter $k$, and a set of $m$ demand pairs $\subseteq V \times V$, the objective is…
The minimum and maximum cuts of an undirected edge-weighted graph are classic problems in graph theory. While the Min-Cut Problem can be solved in P, the Max-Cut Problem is NP-Complete. Exact and heuristic methods have been developed for…
In the Activation Edge-Multicover problem we are given a multigraph $G=(V,E)$ with activation costs $\{c_{e}^u,c_{e}^v\}$ for every edge $e=uv \in E$, and degree requirements $r=\{r_v:v \in V\}$. The goal is to find an edge subset $J…
For any fixed positive integer $r$ and a given budget $k$, the $r$-\textsc{Eigenvalue Vertex Deletion} ($r$-EVD) problem asks if a graph $G$ admits a subset $S$ of at most $k$ vertices such that the adjacency matrix of $G\setminus S$ has at…
We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framework called metric forest completion (MFC), where the learned…
Many network design problems deal with the design of low-cost networks that are resilient to the failure of their elements, such as nodes or links. One such problem is Connectivity Augmentation, where the goal is to cheaply increase the…
For any forest $G = (V, E)$ it is possible to orient the edges $E$ so that no vertex in $V$ has out-degree greater than $1$. This paper considers the incremental edge-orientation problem, in which the edges $E$ arrive over time and the…
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches,…
We augment a tree $T$ with a shortcut $pq$ to minimize the largest distance between any two points along the resulting augmented tree $T+pq$. We study this problem in a continuous and geometric setting where $T$ is a geometric tree in the…
Positive linear programs (LP), also known as packing and covering linear programs, are an important class of problems that bridges computer science, operations research, and optimization. Despite the consistent efforts on this problem, all…
We give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades, since it can be used to compute the Subtree…
We give a 2-approximation algorithm for Non-Uniform Sparsest Cut that runs in time $n^{O(k)}$, where $k$ is the treewidth of the graph. This improves on the previous $2^{2^k}$-approximation in time $\poly(n) 2^{O(k)}$ due to Chlamt\'a\v{c}…
We design and analyse approximation algorithms for the minimum-cost connected T-join problem: given an undirected graph G = (V;E) with nonnegative costs on the edges, and a subset of nodes T, find (if it exists) a spanning connected…
We study approaches for the exact solution of the \NP--hard minimum spanning tree problem under conflict constraints. Given a graph $G(V,E)$ and a set $C \subset E \times E$ of conflicting edge pairs, the problem consists of finding a…
Finding the exact integrality gap $\alpha$ for the LP relaxation of the metric Travelling Salesman Problem (TSP) has been an open problem for over thirty years, with little progress made. It is known that $4/3 \leq \alpha \leq 3/2$, and a…
In the problem (Unweighted) Max-Cut we are given a graph $G = (V,E)$ and asked for a set $S \subseteq V$ such that the number of edges from $S$ to $V \setminus S$ is maximal. In this paper we consider an even harder problem: (Weighted)…
We consider the \emph{Budgeted} version of the classical \emph{Connected Dominating Set} problem (BCDS). Given a graph $G$ and a budget $k$, we seek a connected subset of at most $k$ vertices maximizing the number of dominated vertices in…
The quadratic minimum spanning tree problem (QMSTP) is the problem of finding a spanning tree of a graph such that the total interaction cost between pairs of edges in the tree is minimized. We first show that most of the bounding…
Given a graph $G=(V,E)$ and a set $C$ of unordered pairs of edges regarded as being in conflict, a stable spanning tree in $G$ is a set of edges $T$ inducing a spanning tree in $G$, such that for each $\left\lbrace e_i, e_j \right\rbrace…