Join Our Newsletter

IEICET

2011

8 years 1 months ago
2011

In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...

DISOPT

2011

8 years 1 months ago
2011

We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...

COR

2008

8 years 6 months ago
2008

In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...

ALGORITHMICA

2005

8 years 6 months ago
2005

Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...

CIAC

2006

Springer

8 years 10 months ago
2006

Springer

Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )

ESA

2004

Springer

8 years 12 months ago
2004

Springer

Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...

WAOA

2005

Springer

8 years 12 months ago
2005

Springer

Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...

IWPEC

2009

Springer

9 years 1 months ago
2009

Springer

In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...