Fast Distributed Approximation for Max-Cut (Q5056049): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1707.08496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local 2-Approximation Algorithm for the Vertex Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximation for Max-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Strong Diameter Network Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Constructing Very Sparse Spanners and Emulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Minimum Cut Approximation / 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: Weakly bipartite graphs and the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic almost-tight distributed algorithm for approximating single-source shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large cuts with local algorithms on triangle-free graphs / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation of capacitated dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed minimum dominating set approximations in restricted families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Composable Core-sets for Distributed Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for weighted shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: $$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $${\mathcal O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max Cut and the Smallest Eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405265 / rank
 
Normal rank

Latest revision as of 03:04, 31 July 2024

scientific article; zbMATH DE number 7631532
Language Label Description Also known as
English
Fast Distributed Approximation for Max-Cut
scientific article; zbMATH DE number 7631532

    Statements

    Fast Distributed Approximation for Max-Cut (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references