On the longest spanning tree with neighborhoods (Q777263): Difference between revisions

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 7332161
@@ Property / zbMATH Open document ID @@
+.68265
@@ Property / zbMATH Open document ID: 1496.68265 / rank @@
+Normal rank
@@ Property / DOI @@
+.1142/S1793830920500676
@@ Property / DOI: 10.1142/S1793830920500676 / rank @@
+Normal rank
@@ Property / publication date @@
+April 2021Timestamp +2021-04-09T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2021-04-09T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 9 April 2021 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7332161
@@ Property / zbMATH DE Number: 7332161 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2964284126
@@ Property / OpenAlex ID: W2964284126 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03297
@@ Property / arXiv ID: 1712.03297 / rank @@
+Normal rank
@@ Property / published in @@
+Discrete Mathematics, Algorithms and Applications
+Normal rank
@@ Property / cites work @@
+Farthest neighbors, maximum spanning trees and related problems in higher dimensions
+Normal rank
@@ Property / cites work @@
+Q4327375
@@ Property / cites work: Q4327375 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the Geometric Covering Salesman Problem
+Normal rank
@@ Property / cites work @@
+The geometric maximum traveling salesman problem
@@ Property / cites work: The geometric maximum traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for computing the maximum distance between two finite planar sets
+Normal rank
@@ Property / cites work @@
+Maximum plane trees in multipartite geometric graphs
+Normal rank
@@ Property / cites work @@
+On minimum- and maximum-weight minimum spanning trees with neighborhoods
+Normal rank
@@ Property / cites work @@
+Long non-crossing configurations in the plane
@@ Property / cites work: Long non-crossing configurations in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945509
@@ Property / cites work: Q4945509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252306
@@ Property / cites work: Q4252306 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945516
@@ Property / cites work: Q4945516 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5358292
@@ Property / cites work: Q5358292 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Euclidean maximum spanning trees
@@ Property / cites work: Computing Euclidean maximum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339095
@@ Property / cites work: Q4339095 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
+Normal rank
@@ Property / cites work @@
+Maximum distance between two sets of points in Ed
@@ Property / cites work: Maximum distance between two sets of points in Ed / rank @@
+Normal rank
@@ Property / cites work @@
+A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets
+Normal rank
@@ Property / cites work @@
+Minimum Spanning Tree with Neighborhoods
@@ Property / cites work: Minimum Spanning Tree with Neighborhoods / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:777263