A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (Q5146830)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7304082
Language Label Description Also known as
default for all languages
No label defined
    English
    A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut
    scientific article; zbMATH DE number 7304082

      Statements

      A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (English)
      0 references
      0 references
      0 references
      2 February 2021
      0 references

      Identifiers