Join Our Newsletter

EACL

2009

ACL Anthology

12 years 1 months ago
2009

ACL Anthology

like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...

GAMESEC

2010

12 years 1 months ago
2010

We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...

PPSN

2010

Springer

12 years 1 months ago
2010

Springer

Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...

IJCM

2002

12 years 3 months ago
2002

A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...

JUCS

2007

12 years 3 months ago
2007

: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...

IPL

2007

12 years 3 months ago
2007

Given a metric graph G, we are concerned with ﬁnding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...

CPC

2007

12 years 3 months ago
2007

Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...

EOR

2006

12 years 3 months ago
2006

The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...

COMBINATORICS

2006

12 years 3 months ago
2006

A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...

DM

2010

12 years 3 months ago
2010

: The main purpose of the paper is to develop an approach to the evaluation or the estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate th...