Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7557/pdf/LIPIcs-APPROX-RANDOM-2017-8.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2747965299 / rank | |||
Normal rank | |||
| Property / title | |||
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (English) | |||
| Property / title: Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (English) / rank | |||
Normal rank | |||
Latest revision as of 09:37, 30 July 2024
scientific article; zbMATH DE number 7375813
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph |
scientific article; zbMATH DE number 7375813 |
Statements
28 July 2021
0 references
approximation algorithms
0 references
constraint satisfaction problems
0 references
optimization
0 references
hardness of approximation
0 references
maximum acyclic subgraph
0 references
0 references
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (English)
0 references
