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.

Thuật toán xấp xỉ · Vinony

🌐Tiếng Việt

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

EntityQ621751· pop 20· linked from 395 articles

Thuật toán xấp xỉ

class of algorithms that find approximate solutions to optimization problems

Available in 20 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Italiano
العربية
Czech

Connections

convex optimization

mathematical optimization

Categories

Approximation algorithms Computational complexity theory

Sources

wikipedia.externallinksexternallink

What links here395 pages

Fulkerson Prize

No-three-in-line problem

planar separator theorem

independent set

art gallery problem

time complexity

Feedback arc set

set cover problem

linear programming

bin packing problem

semidefinite programming

linear programming relaxation

2-satisfiability

clique cover problem

golden section search

Tutte polynomial

Similar entities

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

Entitydist 0.35

Entitydist 0.35

perturbation theory

Entitydist 0.38

interior point method

Entitydist 0.39

Remez algorithm

Entitydist 0.39

Quasi-Newton method

Entitydist 0.39

constrained optimization

Entitydist 0.39

nonlinear programming

Entitydist 0.41

explicit and implicit methods

Entitydist 0.41

computational problem

Entitydist 0.42

Entitydist 0.42

Entitydist 0.42

Show 1 more

한국어

via Wikidata sitelinks · CC0

P versus NP problem

Entity

travelling salesperson problem

greedy algorithm

Bellman–Ford algorithm

computer science

International Standard Book Number

mathematical analysis

mathematical proof

digital object identifier

International Standard Serial Number

linear programming

Sign in to save