On Approximation Complexity of Metric Dimension Problem (Q3000502)

From MaRDI portal
Revision as of 01:21, 4 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
On Approximation Complexity of Metric Dimension Problem
scientific article

    Statements

    title
    On Approximation Complexity of Metric Dimension Problem (English)
    0 references
    author
    Mathias Hauptmann
    0 references
    Richard Schmied
    0 references
    Claus Viehmann
    0 references
    publication date
    19 May 2011
    0 references
    zbMATH Keywords
    metric dimension
    0 references
    bounded degree instances
    0 references
    dense instances
    0 references
    approximation algorithms
    0 references
    approximation lower bounds
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    05C85
    0 references
    68W25
    0 references
    zbMATH DE Number
    5897207
    0 references
    OpenAlex ID
    W2034444732
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3000502&oldid=35227722"
    Powered by MediaWiki