Loading...
Search for:
steiner-tree
0.006 seconds
When diameter matters: Parameterized approximation algorithms for bounded diameter minimum steiner tree problem
, Article Theory of Computing Systems ; Volume 58, Issue 2 , 2016 , Pages 287-303 ; 14324350 (ISSN) ; Zarei, A ; Sharif University of Technology
Springer New York LLC
Abstract
Given a graph G with a set of terminals, two weight functions c and d defined on the edge set of G, and a bound D, a popular NP-hard problem in designing networks is to find the minimum cost Steiner tree (under function c) in G, to connect all terminals in such a way that its diameter (under function d) is bounded by D. Marathe et al. (J. Algoritm. 28(1), 142–171, 1998) proposed an (O(lnn),O(lnn)) approximation algorithm for this bicriteria problem, where n is the number of terminals. The first factor reflects the approximation ratio on the diameter bound D, and the second factor indicates the cost-approximation ratio. Later, Kapoor and Sarwat (Theory Comput. Syst. 41(4), 779–794, 2007)...
A web-based multi-optimisation approach for convergent product networks using the Steiner tree
, Article International Journal of Services and Operations Management ; Vol. 17, issue. 2 , 2014 , pp. 142-167 ; ISSN: 17442370 ; Mahdavi, I ; Mahdavi-Amiri, N ; Sharif University of Technology
Abstract
We propose a methodology to determine value by adding functionalities for convergent products. A collection of base functions and sub-functions configure the nodes of a web-based (digital) network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network to assign the links among bases and sub-functions. Then, numerical values as benefits and costs are determined for arcs and nodes respectively, using a mathematical approach. Finally, the Steiner tree methodology...
A heuristic zero/one programming for a bi-objective web-based convergent product networks
, Article International Journal of Advanced Operations Management ; Volume 7, Issue 1 , 2015 , Pages 63-84 ; 1758938X (ISSN) ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
Inderscience Enterprises Ltd
2015
Abstract
In the proposed work, by applying the Steiner tree, a bi-objective mathematical model is developed to consider promotion of convergent products to satisfy two objectives of cost and benefit. The results are some new products with more utility for both the buyer and the producer. The methodology proposed to determine value adding functionalities for convergent products. A collection of base functions and sub-functions configure the nodes of a web-based (digital) network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment....
A web-based methodology for convergent product fuzzy networks using the Steiner tree
, Article Journal of Industrial and Production Engineering ; Volume 30, Issue 7 , 2013 , Pages 415-432 ; 21681015 (ISSN) ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
2013
Abstract
An important manufacturing technology spectrum is to consider rapid and sensitive assemblies through convergent product (CP) in digital environment. We integrate functions and sub-functions using a comprehensive mathematical optimization process. To form the CP, a web-based fuzzy network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is to be a link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network to assign the links among bases and sub-functions. Then, fuzzy...
A learning automata and clustering-based routing protocol for named data networking
, Article Telecommunication Systems ; Volume 65, Issue 1 , 2017 , Pages 9-29 ; 10184864 (ISSN) ; Movaghar, A ; Hoseinzadeh, M ; Sharif University of Technology
Springer New York LLC
2017
Abstract
Named data networking (NDN) is a new information-centric networking architecture in which data or content is identified by a unique name and saved pieces of the content are used in the cache of routers. Certainly, routing is one of the major challenges in these networks. In NDN, to achieve the required data for users, interest messages containing the names of data are sent. Because the source and destination addresses are not included in this package, routers forward them using the names that carried in packages. This forward will continue until the interest package is served. In this paper, we propose a routing algorithm for NDN. The purpose of this protocol is to choose a path with the...
Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem
, M.Sc. Thesis Sharif University of Technology ; Zarei, Alireza (Supervisor)
Abstract
Given a graph G with a set of terminals, two weight functions c and d defined on the edge set of G, and a bound D, a popular NP-hard problem in designing networks is to find the minimum cost Steiner tree (under function c) in G, to connect all terminals in such a way that its diameter (under function d) is bounded by D. Marathe et al. [1] proposed an (O(log2n);O(log2n)) approximation algorithm for this bicriteria problem, where n is the number of terminals. The first factor reflects the approximation ratio on the diameter bound D, and the second factor indicates the cost-approximation ratio. Later, Kapoor and Sarwat [2] introduced a parameterized approximation algorithm with performance...
Minimum Color-spanning Tree
, M.Sc. Thesis Sharif University of Technology ; Abam, Mohammad Ali (Supervisor)
Abstract
In the general case of minimum color-spanning tree which is one of the color-spanning set problems, given a weighted graph with n vertices of k different colors, the goal is to find a subtree of minimum weight such that vertices of this subtree include all the colors in the graph. In the planar case, the input is a complete graph with n colored vertices on the plane and the weight of each edge is the Euclidean distance between its corresponding vertices. In this thesis we consider the problem of minimum color-spanning tree. To this end, first we present various color-spanning set problems and some other related problems like Steiner tree and we study the previous work on these problems. Then...
Connecting guards with minimum Steiner points inside simple polygons
, Article Theoretical Computer Science ; Volume 775 , 2019 , Pages 26-31 ; 03043975 (ISSN) ; Zarei, A ; Sharif University of Technology
Elsevier B.V
2019
Abstract
“How many guards are required to cover an art gallery?” asked Victor Klee in 1973, initiated a deep and interesting research area in computational geometry. This problem, referred to as the Art Gallery Problem, has been considered thoroughly in the literature. A recent version of this problem, introduced by Sadhu et al. in CCCG'10, is related to the connectivity of the guards. In this version, for a given set of initial guards inside a given simple polygon, the goal is to obtain a minimum set of new guards, such that the new guards alongside the initial ones have a connected visibility graph. The visibility graph of a set of points inside a simple polygon is a graph whose vertices correspond...
A learning automata and clustering-based routing protocol for named data networking
, Article Telecommunication Systems ; 2016 , Pages 1-21 ; 10184864 (ISSN) ; Movaghar, A ; Hoseinzadeh, M ; Sharif University of Technology
Springer New York LLC
Abstract
Named Data Networking (NDN) is a new information-centric networking architecture in which data or content is identified by a unique name and saved pieces of the content are used in the cache of routers. Certainly, routing is one of the major challenges in these networks. In NDN, to achieve the required data for users, interest messages containing the names of data are sent. Because the source and destination addresses are not included in this package, routers forward them using the names that carried in packages. This forward will continue until the interest package is served. In this paper, we propose a routing algorithm for NDN. The purpose of this protocol is to choose a path with the...
A distributed cross-layer optimization method for multicast in interference-limited multihop wireless networks
, Article Eurasip Journal on Wireless Communications and Networking ; Volume 2008 , 2008 ; 16871472 (ISSN) ; Khalaj, B. H ; Crespo, P. M ; Sharif University of Technology
2008
Abstract
We consider joint optimization of data routing and resource allocation in multicast multihop wireless networks where interference between links is taken into account. The use of network coding in such scenarios leads to a nonconvex optimization problem. By applying the probability collectives (PCs) technique the original problem is turned into a new problem which is convex over probability distributions. The resulting problem is then further decomposed into a data routing subproblem at network layer and a power allocation subproblem at physical layer in order to achieve a cross-layer distributed solution for the whole range of SINR values. The proposed approach is also extended to minimum...
Parallel minimum spanning tree heuristic for the steiner problem in graphs
, Article 13th International Conference on Parallel and Distributed Systems, ICPADS, Hsinchu, 5 December 2007 through 7 December 2007 ; Volume 1 , December , 2007 ; 15219097 (ISSN); 9781424418909 (ISBN) ; Iranmanesh, Z ; Ghodsi, M ; Sharif University of Technology
2007
Abstract
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of the original graph. Minimum Spanning Tree Heuristic (MSTH) is a heuristic for solving the Steiner problem in graphs. In this paper we first review existing algorithms for solving the Steiner problem in graphs. We then introduce a new parallel version of MSTH on three dimensional mesh of trees architecture. We describe our algorithm and analyze its time complexity. The time complexity analysis shows that the algorithm's running time is O(lg2 n) which is comparable with other existing parallel solutions. © 2007...