Approximability of maximum splitting of k-sets and some other Apx-complete problems
type: Item
instance of: scholarly article
title: Approximability of maximum splitting of k-sets and some other Apx-complete problems
zbMATH Open document ID: 0998.90525
DOI: 10.1016/0020-0190(96)00046-4
author: Viggo Kann
author: Jens Lagergren
author: Alessandro Panconesi
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984081
zbMATH Keywords: Approximation
zbMATH Keywords: Algorithms
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Computational complexity
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00046-4
OpenAlex ID: W2026634792
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: The probabilistic method
cites work: Q4252727
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: .878-approximation algorithms for MAX CUT and MAX 2SAT
cites work: Approximation algorithms for combinatorial problems
cites work: Q4083461
cites work: On the hardness of approximating minimization problems
cites work: Q4231921
cites work: Optimization, approximation, and complexity classes
cites work: The hardness of approximation: Gap location
Wikidata QID: Q127007645
description: scientific article; zbMATH DE number 984081