Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm

DOI10.4230/LIPIcs.ISAAC.2018.45OpenAlexW2962847859MaRDI QIDQ5091037

Annette M. C. Ficker, Erlebach, Thomas, Frits C. R. Spieksma, Matúš Mihalák

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1807.01962

zbMATH Keywords

matchingapproximation algorithmclustering problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Edge-decomposition of graphs into copies of a tree with four edges
• Edge-decompositions of highly connected graphs into paths
• Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
• On the number of perfect matchings of line graphs
• Multi-dimensional vector assignment problems
• The Vector Partition Problem for Convex Objective Functions
• Approximation Algorithms for the Wafer to Wafer Integration Problem
• The Design of Approximation Algorithms
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• On partitioning the edges of graphs into connected subgraphs

This page was built for publication: Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm