Sciweavers

982 search results - page 21 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
14 years 11 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
15 years 4 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
SWAT
1994
Springer
86views Algorithms» more  SWAT 1994»
15 years 1 months ago
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
Arvind Gupta, Naomi Nishimura
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 4 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
15 years 11 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...