A local search algorithm for binary maximum 2-path partitioning (Q1799391)

From MaRDI portal
Revision as of 23:11, 16 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A local search algorithm for binary maximum 2-path partitioning
scientific article

    Statements

    title
    A local search algorithm for binary maximum 2-path partitioning (English)
    0 references
    author
    Refael Hassin
    0 references
    Ohad Schneider
    0 references
    publication date
    18 October 2018
    0 references
    zbMATH Keywords
    analysis of algorithms
    0 references
    maximum path partitioning
    0 references
    2-edge paths
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C70
    0 references
    05C85
    0 references
    68W25
    0 references
    90C27
    0 references
    90C35
    0 references
    zbMATH DE Number
    6958407
    0 references
    OpenAlex ID
    W2045526752
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1799391&oldid=36437567"
    Powered by MediaWiki