On approximation of max-vertex-cover
type: Item
instance of: scholarly article
title: On approximation of max-vertex-cover
zbMATH Open document ID: 1058.90036
DOI: 10.1016/S0377-2217(02)00330-2
author: Qiaoming Han
author: Yinyu Ye
author: Jiawei Zhang
author: Hantao Zhang
published in: European Journal of Operational Research
publication date: 2002-11-20T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1832948
zbMATH Keywords: Max-vertex-cover
zbMATH Keywords: Polynomial approximation algorithm
zbMATH Keywords: Linear programming
zbMATH Keywords: Semidefinite programming
describes a project that uses: Outward rotations
MaRDI profile type: Publication
cites work: Q4263699
cites work: Approximating the independence number via the \(\vartheta\)-function
cites work: Q4247459
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
cites work: Approximation algorithms for maximization problems arising in graph partitioning
cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Q4263713
cites work: Q4537699
cites work: An improved rounding method and semidefinite programming relaxation for graph partition
cites work: Q3002852
cites work: Q4142699
cites work: Q4231921
cites work: Semidefinite relaxation and nonconvex quadratic optimization
cites work: The hardness of approximation: Gap location
cites work: Q4400856
cites work: A .699-approximation algorithm for Max-Bisection.
cites work: Approximating quadratic programming with bound and quadratic constraints
cites work: Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
cites work: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
full work available at URL: s0377-2217(02)00330-2
OpenAlex ID: W2004973717
description: scientific article; zbMATH DE number 1832948