Sciweavers

76 search results - page 5 / 16
» Minimum Spanning Tree on Spatio-Temporal Networks
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 4 months 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
NETWORKS
2010
14 years 8 months ago
Fixed-parameter tractability results for full-degree spanning tree and its dual
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
70
Voted
JPDC
2006
134views more  JPDC 2006»
14 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
INFOCOM
1992
IEEE
15 years 1 months ago
Topological Design of Interconnected LAN-MAN Networks
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
Cem Ersoy, Shivendra S. Panwar
AINA
2009
IEEE
15 years 4 months ago
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Ya...