AbstractThis paper considers a generalization of the capacitated spanning tree problem, in which some of the vertices have capacity K, and the others have capacity k<K. We prove that the problem can be approximated within a constant factor, and present better approximations when k is 1 or 2
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
The minimum k-capacitated tree partition problema (MkCTP) asks for a partition of a graph into two o...
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Se...
We propose some techniques, based on minimum cost flow computations, for efficiently computing lower...
We focus on designing combinatorial algorithms for the CAPACITATED NETWORK DESIGN problem (CAP-SNDP)...
We design combinatorial approximation algorithms for the Capacitated Steiner Network (Cap-SN) proble...
This paper presents a robust branch-cut-and-price algorithm for the CapacitatedMinimumSpanning Tree ...
There is a large discrepancy in our understanding of uncapacitated and capacitated versions of netwo...
In this paper we study the capacitated vertex cover problem, a generalization of the well known vert...
Abstract. We study a network loading problem with applications in lo-cal access network design. Give...
We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalit...
In this paper a survey on existing algorithms for the capacitated minimum spanning tree problem (CMS...
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In ...
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Se...
We study the capacitated vertex cover problem (CVC). In this natural extension to the vertex cover p...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
The minimum k-capacitated tree partition problema (MkCTP) asks for a partition of a graph into two o...
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Se...
We propose some techniques, based on minimum cost flow computations, for efficiently computing lower...
We focus on designing combinatorial algorithms for the CAPACITATED NETWORK DESIGN problem (CAP-SNDP)...
We design combinatorial approximation algorithms for the Capacitated Steiner Network (Cap-SN) proble...
This paper presents a robust branch-cut-and-price algorithm for the CapacitatedMinimumSpanning Tree ...
There is a large discrepancy in our understanding of uncapacitated and capacitated versions of netwo...
In this paper we study the capacitated vertex cover problem, a generalization of the well known vert...
Abstract. We study a network loading problem with applications in lo-cal access network design. Give...
We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalit...
In this paper a survey on existing algorithms for the capacitated minimum spanning tree problem (CMS...
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In ...
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Se...
We study the capacitated vertex cover problem (CVC). In this natural extension to the vertex cover p...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
The minimum k-capacitated tree partition problema (MkCTP) asks for a partition of a graph into two o...
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Se...
DOI
Add to ORKG