Pages that link to "Approximation algorithm"
Jump to navigation
Jump to search
The following pages link to Approximation algorithm:
Displaying 50 items.
- Grundy number (← links)
- Kőnig's theorem (graph theory) (← links)
- Maximum cardinality matching (← links)
- Maximum weight matching (← links)
- Linear programming relaxation (← links)
- Per Enflo (← links)
- Umesh Vazirani (← links)
- Barnes–Hut simulation (← links)
- Cactus graph (← links)
- Multi-objective optimization (← links)
- Optimal facility location (← links)
- SNP (complexity) (← links)
- K-approximation of k-hitting set (← links)
- Clique-width (← links)
- Price of anarchy (← links)
- Crossing number (graph theory) (← links)
- Longest path problem (← links)
- Planar separator theorem (← links)
- Maximum cut (← links)
- Bipartite dimension (← links)
- Computing the permanent (← links)
- Set splitting problem (← links)
- Correlation clustering (← links)
- MAXEkSAT (← links)
- NP-completeness (← links)
- Cycle basis (← links)
- Quasi-polynomial time (← links)
- Data stream clustering (← links)
- Metric k-center (← links)
- Sharp-SAT (← links)
- Cycle rank (← links)
- Tree-depth (← links)
- Randomized rounding (← links)
- Method of conditional probabilities (← links)
- Natural computing (← links)
- Caterpillar tree (← links)
- Graph bandwidth (← links)
- Ε-net (computational geometry) (← links)
- Contraction hierarchies (← links)
- Dense subgraph (← links)
- Sauer–Shelah lemma (← links)
- Weak duality (← links)
- Courcelle's theorem (← links)
- Kinetic smallest enclosing disk (← links)
- Fleischner's theorem (← links)
- Circular layout (← links)
- Arc diagram (← links)
- Opaque set (← links)
- Well-separated pair decomposition (← links)
- Chirp spectrum (← links)