Exact exponential algorithms for clustering problems
From MaRDI portal
Cites work
- A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
- A faster algorithm for dominating set analyzed by the potential method
- A measure \& conquer approach for the analysis of exact algorithms
- An improved approximation algorithm for ATSP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Easy and hard bottleneck location problems
- Exact algorithms via monotone local search
- Exact and approximation algorithms for clustering
- Exact exponential algorithms.
- scientific article; zbMATH DE number 3129892 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Least squares quantization in PCM
- Lower bounds based on the exponential time hypothesis
- On problems as hard as CNF-SAT
- On the complexity of k-SAT
- On the Complexity of General Graph Factor Problems
- Packing bipartite graphs with covers of complete bipartite graphs
- Parameterized algorithms
- Paths, Trees, and Flowers
- Set partitioning via inclusion-exclusion
Cited in
(4)- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- On connections between k-coloring and Euclidean k-means
- Faster exponential algorithms for cut problems via geometric data structures
This page was built for publication: Exact exponential algorithms for clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968999)
