Matches in SemOpenAlex for { <https://semopenalex.org/work/W88291963> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W88291963 abstract "A spanning tree is a very simple and common communication network model. The minimum (cost) spanning tree (MST) of a connected graph G = (V, E) may not be unique if two or more edges have the same cost. The transmission delay between two nodes in a spanning tree network is measured in terms of its path length. When the minimum cost spanning tree is not unique, the one that minimizes transmission delay is desired. The bicriteria (total cost and transmission delay) optimization problem, the so called minimum radius minimum cost spanning tree or the minimum diameter minimum cost spanning tree problems is known to be NP-hard. Its geometrical version was open. In this dissertation, it is shown that for given point set in the plane, the problem of determining the existence of a spanning tree with total weight and radius (or diameter) upper-bounded, by two given parameters C and R (or D), respectively is NP-complete. An O(m log n) time algorithm is presented for computing the union graph and the intersection graph of all MST's, where m = |E| and n = |V|. Also presented are some heuristic algorithms for finding a suboptimal minimum radius (or diameter) minimum spanning tree. It is shown that the heuristic algorithm based on a locally optimal connection strategy can have an O(n1/3) performance ratio in some cases, where n is the number of points. Experimental results indicate that the heuristic based on a modified Prim's MST algorithm, MST_H1 outperforms Prim's MST (minimum spanning tree algorithm) overall and the output of the heuristic can be used as a new oracle MST for other problems. This may contribute to improving performance of many heuristic algorithms for other problems where an initial (arbitrary) MST is needed." @default.
- W88291963 created "2016-06-24" @default.
- W88291963 creator A5000058294 @default.
- W88291963 creator A5038072358 @default.
- W88291963 date "1999-01-01" @default.
- W88291963 modified "2023-09-22" @default.
- W88291963 title "On the complexity of bicriteria spanning tree problems for a set of points in the plane" @default.
- W88291963 hasPublicationYear "1999" @default.
- W88291963 type Work @default.
- W88291963 sameAs 88291963 @default.
- W88291963 citedByCount "1" @default.
- W88291963 crossrefType "journal-article" @default.
- W88291963 hasAuthorship W88291963A5000058294 @default.
- W88291963 hasAuthorship W88291963A5038072358 @default.
- W88291963 hasConcept C100560664 @default.
- W88291963 hasConcept C114614502 @default.
- W88291963 hasConcept C132525143 @default.
- W88291963 hasConcept C13743678 @default.
- W88291963 hasConcept C145685049 @default.
- W88291963 hasConcept C163797641 @default.
- W88291963 hasConcept C197855036 @default.
- W88291963 hasConcept C199346575 @default.
- W88291963 hasConcept C202750272 @default.
- W88291963 hasConcept C23394520 @default.
- W88291963 hasConcept C2778945305 @default.
- W88291963 hasConcept C33923547 @default.
- W88291963 hasConcept C37810922 @default.
- W88291963 hasConcept C63645285 @default.
- W88291963 hasConcept C64271015 @default.
- W88291963 hasConcept C64331007 @default.
- W88291963 hasConcept C65949645 @default.
- W88291963 hasConcept C76220878 @default.
- W88291963 hasConcept C76444178 @default.
- W88291963 hasConceptScore W88291963C100560664 @default.
- W88291963 hasConceptScore W88291963C114614502 @default.
- W88291963 hasConceptScore W88291963C132525143 @default.
- W88291963 hasConceptScore W88291963C13743678 @default.
- W88291963 hasConceptScore W88291963C145685049 @default.
- W88291963 hasConceptScore W88291963C163797641 @default.
- W88291963 hasConceptScore W88291963C197855036 @default.
- W88291963 hasConceptScore W88291963C199346575 @default.
- W88291963 hasConceptScore W88291963C202750272 @default.
- W88291963 hasConceptScore W88291963C23394520 @default.
- W88291963 hasConceptScore W88291963C2778945305 @default.
- W88291963 hasConceptScore W88291963C33923547 @default.
- W88291963 hasConceptScore W88291963C37810922 @default.
- W88291963 hasConceptScore W88291963C63645285 @default.
- W88291963 hasConceptScore W88291963C64271015 @default.
- W88291963 hasConceptScore W88291963C64331007 @default.
- W88291963 hasConceptScore W88291963C65949645 @default.
- W88291963 hasConceptScore W88291963C76220878 @default.
- W88291963 hasConceptScore W88291963C76444178 @default.
- W88291963 hasLocation W882919631 @default.
- W88291963 hasOpenAccess W88291963 @default.
- W88291963 hasPrimaryLocation W882919631 @default.
- W88291963 hasRelatedWork W1491195793 @default.
- W88291963 hasRelatedWork W1561849181 @default.
- W88291963 hasRelatedWork W1930167353 @default.
- W88291963 hasRelatedWork W1965810411 @default.
- W88291963 hasRelatedWork W1983511657 @default.
- W88291963 hasRelatedWork W2010585027 @default.
- W88291963 hasRelatedWork W2059559155 @default.
- W88291963 hasRelatedWork W2126397829 @default.
- W88291963 hasRelatedWork W2159991628 @default.
- W88291963 hasRelatedWork W2349424300 @default.
- W88291963 hasRelatedWork W2352525723 @default.
- W88291963 hasRelatedWork W2396379829 @default.
- W88291963 hasRelatedWork W2809830069 @default.
- W88291963 hasRelatedWork W2892748093 @default.
- W88291963 hasRelatedWork W2899171524 @default.
- W88291963 hasRelatedWork W2967092405 @default.
- W88291963 hasRelatedWork W3010374802 @default.
- W88291963 hasRelatedWork W3155900666 @default.
- W88291963 hasRelatedWork W3187208706 @default.
- W88291963 hasRelatedWork W3195481350 @default.
- W88291963 isParatext "false" @default.
- W88291963 isRetracted "false" @default.
- W88291963 magId "88291963" @default.
- W88291963 workType "article" @default.