Approximate association via dissociation (Q505447): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the hardness of approximating minimization problems / rank | |||
Normal rank | |||
Latest revision as of 07:30, 13 July 2024
scientific article; zbMATH DE number 6667975
- Approximate Association via Dissociation
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate association via dissociation |
scientific article; zbMATH DE number 6667975 |
|
Statements
Approximate association via dissociation (English)
0 references
Approximate Association via Dissociation (English)
0 references
23 January 2017
0 references
22 December 2016
0 references
association set
0 references
cluster vertex deletion
0 references
dissociation set
0 references
cluster graph
0 references
modular decomposition
0 references
triangle-free graph
0 references
