Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771)

From MaRDI portal
Revision as of 00:37, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q115525641, #quickstatements; #temporary_batch_1706826130171)
scientific article; zbMATH DE number 6913595
Language Label Description Also known as
English
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem
scientific article; zbMATH DE number 6913595

    Statements

    Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2018
    0 references
    approximation algorithms
    0 references
    multiway
    0 references
    cut
    0 references
    randomized
    0 references
    simplex
    0 references

    Identifiers

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