On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Empirical analysis of algorithms for the shortest negative cost cycle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to dynamic all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for finding the shortest negative cost cycle in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal length resolution refutations of difference constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for optimal length resolution refutation in difference constraint systems / rank
 
Normal rank

Latest revision as of 05:01, 16 July 2024

scientific article
Language Label Description Also known as
English
On approximating optimal weight ``no''-certificates in weighted difference constraint systems
scientific article

    Statements

    On approximating optimal weight ``no''-certificates in weighted difference constraint systems (English)
    0 references
    20 July 2018
    0 references
    0 references
    difference constraint system
    0 references
    ``no''-certificate
    0 references
    approximation algorithm
    0 references
    graph theory
    0 references
    negative cost cycle
    0 references
    certification
    0 references
    0 references