Approximation algorithms for bipartite matching with metric and geometric costs (Q5259591)

From MaRDI portal
Revision as of 09:44, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6451585
Language Label Description Also known as
English
Approximation algorithms for bipartite matching with metric and geometric costs
scientific article; zbMATH DE number 6451585

    Statements

    title
    Approximation algorithms for bipartite matching with metric and geometric costs (English)
    0 references
    author
    R. Sharathkumar
    0 references
    Pankaj K. Agarwal
    0 references
    publication date
    26 June 2015
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    matching
    0 references
    cites work
    Q5302085
    0 references
    Theory of Cryptography
    0 references
    Q3549600
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C70
    0 references
    05C22
    0 references
    05C85
    0 references
    68W25
    0 references
    zbMATH DE Number
    6451585
    0 references
    OpenAlex ID
    W2079168081
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5259591&oldid=36080529"
    Powered by MediaWiki