A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs
2010
Journal of Supercomputing
Preserved Fulltext
This is due to the fact that the minimum spanning tree problem becomes incredibly hard to solve when the edge weight is assumed to be a random variable. ...
As the presented algorithm proceeds, the sampling process is concentrated on the edges that constitute the spanning tree with the minimum expected weight. ...
The proposed algorithm consists of a number of stages and at each stage one of the possible spanning trees is randomly constructed. ...
doi:10.1007/s11227-010-0484-1
fatcat:lpg2w3664rctrjcmj4pk37p7sm
On Two-Stage Stochastic Minimum Spanning Trees
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We consider the undirected minimum spanning tree problem in a stochastic optimization setting. ...
For the two-stage stochastic optimization formulation with finite scenarios, a simple iterative randomized rounding method on a natural LP formulation of the problem yields a nearly best-possible approximation ...
One of the basic problems in network design is the minimum cost spanning tree problem. ...
doi:10.1007/11496915_24
fatcat:qw4dfd6lfnfqzktcuz4ynghcjm
An Approach of Community Search with Minimum Spanning Tree Based on Node Embedding
2021
Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a two-stage community search algorithm with a minimum spanning tree strategy based on node embedding. ...
At the second stage, we propose a new definition of community from the distance viewpoint, transform the problem of community search to a variant of minimum spanning tree problem, and uncover the target ...
Based on this, we formally define the community search problem based on minimum spanning tree as follows. Problem 2. (community search based on minimum spanning tree). ...
doi:10.1155/2021/6673444
fatcat:yqhzogfmmzgwtjs3rjlab5z4te
Solving the Minimum Spanning Tree Problem in Stochastic Graphs Using Learning Automata
2009
2009 International Conference on Information Management and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose some learning automatabased algorithms to solve the minimum spanning tree problem in stochastic graphs when the probability distribution function of the edge's weight is unknown ...
In these algorithms, at each stage a set of learning automata determines which edges to be sampled. ...
INTRODUCTION A minimum spanning tree (MST) of an edge-weighted network is a spanning tree having the minimum sum of edge weights among all spanning trees. ...
doi:10.1109/icime.2009.139
fatcat:xbjh2kzpqzajfn5r767d6xwevy
Learning automata-based algorithms for solving stochastic minimum spanning tree problem
2011
Applied Soft Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
As the proposed algorithm proceeds, the sampling process focuses on the spanning tree with the minimum expected weight. ...
Due to the hardness of solving the minimum spanning tree (MST) problem in stochastic environments, the stochastic MST (SMST) problem has not received the attention it merits, specifically when the probability ...
Figure 3 . 3 Sample graph G and its minimum spanning tree Let ) (k q i be the choice probability of spanning tree i τ at stage k . Therefore we have,
the proof of the lemma.
stage k . ...
doi:10.1016/j.asoc.2011.02.017
fatcat:yccd2c5d5jbe5f6jmwovrimzee
Minimum Spanning Tree Algorithm for Skin Cancer Image Object Detection
2019
Journal of College of Education for Women
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This ObjectDetection descriptor builds on the structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer Images only. ...
This paper proposes a new method Object Detection in Skin Cancer Image, the minimum spanning tree Detection descriptor (MST). ...
The minimum spanning tree problem is one of the most famous combinatorial problems in computer science. ...
doaj:e638d75e59284549b7b3dd7132f640db
fatcat:jomdmqgfgbegnb22bz6ufxaoda
On the approximability of robust spanning tree problems
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper the minimum spanning tree problem with uncertain edge costs is discussed. ...
In this paper randomized LP-based approximation algorithms with performance ratio of O(^2 n) for min-max and 2-stage min-max problems are also proposed. ...
Randomized algorithm for 2-stage spanning tree In this section we construct a randomized approximation algorithm for 2-Stage Spanning Tree, which is based on a similar idea as the corresponding algorithm ...
arXiv:1004.2891v1
fatcat:fhmwoqhxgbdt3mawhu7yg5leca
Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
1992
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Additionally, we present an optimal deterministic algorithm and a linear-time randomized algorithm for sensitivity analysis of minimum spanning trees. 1. Introduction. ...
Koml os has devised a way to use a linear number of binary comparisons to test whether a given spanning tree of a graph with edge costs is a minimum spanning tree. ...
Suppose every edge fv; wg 2 E has a real-valued cost c(v; w). A minimum spanning tree of G is a spanning tree whose total edge cost is minimum. ...
doi:10.1137/0221070
fatcat:o35kdqceazdllb2bwb3piksknq
Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm
2015
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Degree constrained minimum spanning tree (DCMST) refers to constructing a spanning tree of minimum weight in a complete graph with weights on edges while the degree of each node in the spanning tree is ...
Finally, multiple groups of experimental data show the superiority of the improved algorithm in solving the problems of degree constrained minimum spanning tree. ...
Acknowledgments The project is supported by the National Natural Science Foundation of China (Grant no. 61173032), the Young Scientists Fund of the National Natural Science Foundation of China (Grant no ...
doi:10.1155/2015/601782
fatcat:s2czrowxlnd6favp5lo3woigve
A new evolutionary approach to the degree-constrained minimum spanning tree problem
2000
IEEE Transactions on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
While other researchers have mainly concentrated on nding spanning trees in Euclidean graphs, we consider the more general case of random graph problems. ...
Finding the degree-constrained minimum spanning tree (d-MST) of a graph is a wellstudied NP-hard problem of importance in communications network design and other network-related problems. ...
The project is particularly concerned with the optimisation of growing networks, both in terms of network design and the management of tra c, and is sponsored by BT Labs Plc. ...
doi:10.1109/4235.850653
fatcat:4yweork5kzf5pl3no6nm7dmuti
Rethinking Learnable Tree Filter for Generic Feature Transform
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Besides, we propose a learnable spanning tree algorithm to replace the original non-differentiable one, which further improves the flexibility and robustness. ...
To relax the geometric constraint, we give the analysis by reformulating it as a Markov Random Field and introduce a learnable unary term. ...
Moreover, a close random spanning tree algorithm is designed to replace the original minimum spanning tree in the training phase. ...
arXiv:2012.03482v1
fatcat:txtldw7mdjamlleleuzaisvn4y
On the approximability of robust spanning tree problems
2011
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper the minimum spanning tree problem with uncertain edge costs is discussed. ...
In this paper randomized LP-based approximation algorithms with performance bound of O(log 2 n) for min-max and 2-stage min-max problems are also proposed. ...
Randomized algorithm for 2-stage spanning tree In this section we construct a randomized approximation algorithm for 2-Stage Spanning Tree, which is based on a similar idea as the corresponding algorithm ...
doi:10.1016/j.tcs.2010.10.006
fatcat:vsyx7ynwj5eqhifkzqob7fggru
Distributed verification and hardness of distributed approximation
2011
Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The vertices may have to compute (cooperatively) some global function of the graph, such as a spanning tree (ST) or a minimum spanning tree (MST), via communicating with each other and running a distributed ...
tree, shortest paths, and minimum cut. ...
Recall that in the minimum spanning tree problem, we are given a connected graph G and we want to compute the minimum spanning tree (i.e., the spanning tree of minimum weight). ...
doi:10.1145/1993636.1993686
dblp:conf/stoc/SarmaHKKNPPW11
fatcat:igixoskxrbhntjdntoox7snmnq
Distributed Verification and Hardness of Distributed Approximation
2012
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The vertices may have to compute (cooperatively) some global function of the graph, such as a spanning tree (ST) or a minimum spanning tree (MST), via communicating with each other and running a distributed ...
tree, shortest paths, and minimum cut. ...
Recall that in the minimum spanning tree problem, we are given a connected graph G and we want to compute the minimum spanning tree (i.e., the spanning tree of minimum weight). ...
doi:10.1137/11085178x
fatcat:xkvkvn6hlnh6vi4f56szewjv4m
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service ...
We present a construction heuristic based on Kruskal's algorithm for finding a minimum cost spanning tree which eliminates some drawbacks of existing heuristic methods. ...
Conclusions and Future Work We introduced a Kruskal-based construction heuristic for the rooted delayconstrained minimum spanning tree problem which produces faster and better results especially for tight ...
doi:10.1007/978-3-642-04772-5_92
fatcat:qvy4zigz5reidoi4yxf4acnxpi
« Previous
Showing results 1 — 15 out of 65,268 results