Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

최근접 이웃 알고리즘 · Vinony

Home
Approximation algorithms
최근접 이웃 알고리즘

🌐한국어

English Deutsch Español Français Italiano Polski Português Tiếng Việt Русский العربية 한국어 日本語

EntityQ1374523· pop 14· linked from 9 articles

최근접 이웃 알고리즘

Also known as nearest-neighbour algorithm

used to determine solution to travelling salesman problem

Available in 14 languages

Español
Deutsch
日本語
Русский
Português
Italiano
العربية
Bulgarian
Polski

Connections

travelling salesperson problem

Categories

Approximation algorithms Graph algorithms Heuristic algorithms Travelling salesman problem

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

time complexity

Entity

graph data structure

upper and lower bounds

approximation algorithm

Christofides algorithm

space complexity

Best, worst and average case

Sign in to save

What links here9 pages

travelling salesperson problem

search algorithm

one-shot learning

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

nearest neighbor search

Entitydist 0.38

Iterative closest point

Entitydist 0.44

bidirectional search

Entitydist 0.49

Entitydist 0.50

closest pair of points problem

Entitydist 0.52

shortest path problem

Entitydist 0.54

Euclidean minimum spanning tree

Entitydist 0.56

convex hull algorithm

Entitydist 0.57

nearest-neighbor interpolation

Entitydist 0.57

Chan's algorithm

Entitydist 0.57

The Weber Problem

Entitydist 0.58

inverse distance weighting

Entitydist 0.59