Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
Publication:3893362
DOI10.1137/0209017zbMath0447.68111OpenAlexW2091757707MaRDI QIDQ3893362
No author found.
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209017
NP-completenesstraveling salesman problemcomputational geometryminimum spanning treeworst-case analysisHamiltonian pathapproximate algorithmnearest neighbor methodnear-optimal algorithmaverage case performanceclosest insertion methodopen path problemscheduling of read/write headstwo-dimensional storage mediumvoronoi diagram
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)
Related Items (31)
This page was built for publication: Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications