Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is constraint satisfaction over two variables always easy? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious algorithms for the maximum directed cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Characterization of Approximation Resistance for Symmetric CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 2-CSP allows nontrivial approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable distributions, pseudorandom generators, embeddings, and data stream computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Lower Bounds for Approximating MAX-CUT / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finite-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel approximation algorithms by positive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365017 / rank
 
Normal rank
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

    0 references
    0 references
    0 references
    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
    Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references