Approximation complexity of metric dimension problem (Q450564): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.12.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2174493139 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56551563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximability results for test set problems in bioinformatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Metric Dimension of Cartesian Products of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Metric Dimension of Infinite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvability in graphs and the metric dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mastermind / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metric dimension of Cayley digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Graph Theory for Metric Dimension and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Metric Generators of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatory Detection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrepancies between metric dimension and partition dimension of a connected graph / rank
 
Normal rank

Latest revision as of 17:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximation complexity of metric dimension problem
scientific article

    Statements

    Approximation complexity of metric dimension problem (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references
    metric dimension
    0 references
    bounded degree instances
    0 references
    dense instances
    0 references
    approximation algorithms
    0 references
    approximation lower bounds
    0 references

    Identifiers