Sciweavers

326 search results - page 2 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 12 days ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
COCOC
1995
150views Combinatorics» more  COCOC 1995»
13 years 9 months ago
On Central Spanning Trees of a Graph
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke
EOR
2006
130views more  EOR 2006»
13 years 5 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
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...
Roberto Montemanni
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
13 years 9 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
EACL
2009
ACL Anthology
13 years 3 months ago
Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
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...
Stephen Wan, Mark Dras, Robert Dale, Cécile...