๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation algorithms for indefinite complex quadratic maximization problems

โœ Scribed by Huang, Yongwei; Zhang, Shuzhong


Book ID
120796465
Publisher
SP Science China Press
Year
2010
Tongue
English
Weight
236 KB
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Approximation Algorithms for Maximizatio
โœ Uriel Feige; Michael Langberg ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 261 KB

Given a graph G = V E , a weight function w E โ†’ R + , and a parameter k, we consider the problem of finding a subset U โІ V of size k that maximizes: Max-Vertex Cover k the weight of edges incident with vertices in U, Max-Dense Subgraph k the weight of edges in the subgraph induced by U, Max-Cut k th