AbstractThe problems of finding an optimum arborescence of a given digraph with respect to an objective function obtained combining linearly two (or more) objective functions of various kinds are studied
AbstractThe main result of this paper is the following theorem: Let G = (X,E) be a digraph without l...
Also published as a journal article: Lecture Notes in Computer Science, 2006; 3887:745-756We give fa...
AbstractGiven a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding...
AbstractThe problems of finding an optimum arborescence of a given digraph with respect to an object...
The problems of finding an optimum arborescenceof a given digraph with respect to an objective funct...
AbstractWe consider a general class of optimization problems regarding spanning trees in directed gr...
A classical approach to multicriteria problems asks for the optimization of a suitable linear combin...
The minimum-cost arborescence problem is a well-studied problem in the area of graph theory, with kn...
Given a digraph $D=(V,A)$ and a positive integer $k$, an arc set $F\subseteq A$ is called a $k$-arbo...
We revisit fundamental problems in undirected and directed graphs, such as the problems of computing...
We investigate two versions of multiple objective minimum spanning tree problems defined on a netwo...
In 1998, Hu and Liu developed a strongly polynomial algorithm for solving the inverse arborescence p...
The Euclidean arborescence problem involves the creation of rooted trees embedded in the plane usin...
Let a communication network be modelled by a directed graph G=(V,E) of n nodes and m edges, and assu...
We present an O(vopt)-approximation algorithm for the maximum leaf spanning arborescence problem, wh...
AbstractThe main result of this paper is the following theorem: Let G = (X,E) be a digraph without l...
Also published as a journal article: Lecture Notes in Computer Science, 2006; 3887:745-756We give fa...
AbstractGiven a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding...
AbstractThe problems of finding an optimum arborescence of a given digraph with respect to an object...
The problems of finding an optimum arborescenceof a given digraph with respect to an objective funct...
AbstractWe consider a general class of optimization problems regarding spanning trees in directed gr...
A classical approach to multicriteria problems asks for the optimization of a suitable linear combin...
The minimum-cost arborescence problem is a well-studied problem in the area of graph theory, with kn...
Given a digraph $D=(V,A)$ and a positive integer $k$, an arc set $F\subseteq A$ is called a $k$-arbo...
We revisit fundamental problems in undirected and directed graphs, such as the problems of computing...
We investigate two versions of multiple objective minimum spanning tree problems defined on a netwo...
In 1998, Hu and Liu developed a strongly polynomial algorithm for solving the inverse arborescence p...
The Euclidean arborescence problem involves the creation of rooted trees embedded in the plane usin...
Let a communication network be modelled by a directed graph G=(V,E) of n nodes and m edges, and assu...
We present an O(vopt)-approximation algorithm for the maximum leaf spanning arborescence problem, wh...
AbstractThe main result of this paper is the following theorem: Let G = (X,E) be a digraph without l...
Also published as a journal article: Lecture Notes in Computer Science, 2006; 3887:745-756We give fa...
AbstractGiven a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding...
DOI
Add to ORKG