Work

A Polynomial Time Approximation Scheme for Subdense MAX-CUT

Year: 2002

Type: preprint

Source: Electronic colloquium on computational complexity

Authors: Vega W. Fernandez de la, Karpinski Marek

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W21169911

Cites: 3

Cited by: 7

Related to: 10