Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Complexity and approximation for discriminating and identifying code problems in geometric setups - MaRDI portal

Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885)

From MaRDI portal
scientific article; zbMATH DE number 7704063
Language Label Description Also known as
English
Complexity and approximation for discriminating and identifying code problems in geometric setups
scientific article; zbMATH DE number 7704063

    Statements

    title
    Complexity and approximation for discriminating and identifying code problems in geometric setups (English)
    0 references
    author
    Sanjana Dey
    0 references
    Florent Foucaud
    0 references
    Subhas C. Nandy
    0 references
    Arunabha Sen
    0 references
    published in
    Algorithmica
    0 references
    publication date
    28 June 2023
    0 references
    zbMATH Keywords
    discriminating code
    0 references
    identifying code
    0 references
    approximation algorithm
    0 references
    segment stabbing
    0 references
    geometric hitting set
    0 references
    cites work
    Q5452284
    0 references
    Q4398780
    0 references
    Priority Search Trees
    0 references
    Q4739657
    0 references

    Identifiers

    arXiv ID
    2009.10353
    0 references
    zbMATH DE Number
    7704063
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6107885&oldid=37530721"
    Powered by MediaWiki