Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 1424308 - MaRDI portal

scientific article; zbMATH DE number 1424308

From MaRDI portal
Publication:4945521

zbMath0995.65028MaRDI QIDQ4945521

Michiel H. M. Smid

Publication date: 23 October 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (25)

Approximating geometric bottleneck shortest pathsDistributed construction of low-interference spannersAn optimized divide-and-conquer algorithm for the closest-pair problem in the planar caseOn the stabbing number of a random Delaunay triangulationNew bounds for range closest-pair problemsA new coding-based algorithm for finding closest pair of vectorsOn the power of the semi-separated pair decompositionOn the largest empty axis-parallel box amidst \(n\) pointsComputing the greedy spanner in near-quadratic timeSparse geometric graphs with small dilationI/O-efficient algorithms for computing planar geometric spannersDilation-Optimal Edge Deletion in Polygonal CyclesRange closest-pair search in higher dimensionsComputing a minimum-dilation spanning tree is NP-hardSearching for the closest-pair in a query translateA simple and efficient kinetic spannerWell-separated pair decomposition in linear time?Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchiesRegion-fault tolerant geometric spannersComputing the dilation of edge-augmented graphs in metric spacesSearching for equilibrium positions in a game of political competition with restrictionsFacility location problems in the plane based on reverse nearest neighbor queriesClosest-pair queries in fat rectanglesNew Bounds for Range Closest-Pair ProblemsApproximate \(k\)-closest-pairs in large high-dimensional data sets




This page was built for publication: