Oblivious algorithms for the maximum directed cut problem (Q2346965): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New local search approximation techniques for maximum generalized satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum directed cuts in acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Sharp Inapproximability for Any 2-CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online maximum directed cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / 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: Q2768265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / 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: Maximum directed cuts in digraphs with degree restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with random arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: AdWords and generalized online matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey on Oblivious Routing Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of local algorithms / 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: Generalization of a theorem by v. Neumann concerning zero sum two person games / rank
 
Normal rank

Latest revision as of 02:47, 10 July 2024

scientific article
Language Label Description Also known as
English
Oblivious algorithms for the maximum directed cut problem
scientific article

    Statements

    Oblivious algorithms for the maximum directed cut problem (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    linear programming
    0 references
    local algorithms
    0 references

    Identifiers

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