A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (Q3603524): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): conf/wads/DeshpandeKDS07, #quickstatements; #temporary_batch_1731475607626
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Sanjay E. Sarma / rank
Normal rank
 
Property / author
 
Property / author: Sanjay E. Sarma / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56504465 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048740780 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/wads/DeshpandeKDS07 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:13, 13 November 2024

scientific article
Language Label Description Also known as
English
A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
scientific article

    Statements

    A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2009
    0 references

    Identifiers