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.

set cover problem · Vinony

🌐English

English Deutsch Español Français Nederlands Português Русский فارسی ไทย 한국어 中文日本語

EntityQ1192100· pop 15· linked from 76 articles

set cover problem

Also known as set covering

classical problem in combinatorics

Available in 14 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Hebrew
Nederlands
Ukrainian

Connections

approximation algorithm

Categories

Approximation algorithms Covering problems Families of sets Linear programming NP-complete problems

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

vertex cover

Entity

computer science

International Standard Book Number

Wayback Machine

digital object identifier

International Standard Serial Number

discrete mathematics

linear programming

operations research

Sign in to save

Similar entities

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

Entitydist 0.50

Entitydist 0.53

Entitydist 0.54

Entitydist 0.56

square packing in a square

Entitydist 0.60

Entitydist 0.61

Entitydist 0.63

Entitydist 0.66

least-upper-bound property

Entitydist 0.66

Entitydist 0.67

Entitydist 0.69

Entitydist 0.69

What links here76 pages

combinatorial optimization

packing problem

Steiner tree problem

approximation algorithm

memetic algorithm

ant colony optimization algorithms

bin packing problem

linear programming relaxation

linear programming

time complexity

Václav Chvátal

greedy algorithm

art gallery problem

abductive reasoning

Quine–McCluskey algorithm

Karp's 21 NP-complete problems

Mihalis Yannakakis

vehicle routing problem