Covering segments with unit squares (Q5894547): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Merged Item from Q5920092
 
(8 intermediate revisions by 6 users not shown)
description / endescription / en
scientific article; zbMATH DE number 7038745
scientific article; zbMATH DE number 6778691
Property / author
 
Property / author: Subhas C. Nandy / rank
Normal rank
 
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1470.68230 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-62127-2_1 / rank
 
Normal rank
Property / author
 
Property / author: Subhas C. Nandy / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
22 September 2017
Timestamp+2017-09-22T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 22 September 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6778691 / rank
 
Normal rank
Property / zbMATH Keywords
 
PTAS
Property / zbMATH Keywords: PTAS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2914405352 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2540164296 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.07256 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:56, 29 April 2024

scientific article; zbMATH DE number 6778691
Language Label Description Also known as
English
Covering segments with unit squares
scientific article; zbMATH DE number 6778691

    Statements

    Covering segments with unit squares (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 March 2019
    0 references
    22 September 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    segment cover
    0 references
    unit square
    0 references
    NP-hardness
    0 references
    linear programming
    0 references
    approximation algorithms
    0 references
    PTAS
    0 references
    0 references
    0 references
    0 references