Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
From MaRDI portal
Recommendations
- An approximation algorithm for a problem of cluster analysis
- A 2-approximation polynomial algorithm for a clustering problem
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- The complexity of vector partition
- An approximating polynomial algorithm for a sequence partitioning problem
Cites work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for the wafer to wafer integration problem
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
- Edge-decomposition of graphs into copies of a tree with four edges
- Edge-decompositions of highly connected graphs into paths
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- Multi-dimensional vector assignment problems
- On partitioning the edges of graphs into connected subgraphs
- On the number of perfect matchings of line graphs
- The design of approximation algorithms
- The vector partition problem for convex objective functions.
This page was built for publication: Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091037)
