Minimum covering with travel cost (Q454247): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6088781 / rank
 
Normal rank
Property / zbMATH Keywords
 
covering
Property / zbMATH Keywords: covering / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum Watchman problem
Property / zbMATH Keywords: minimum Watchman problem / rank
 
Normal rank
Property / zbMATH Keywords
 
limited visibility
Property / zbMATH Keywords: limited visibility / rank
 
Normal rank
Property / zbMATH Keywords
 
lawn mowing
Property / zbMATH Keywords: lawn mowing / rank
 
Normal rank
Property / zbMATH Keywords
 
bicriteria problems
Property / zbMATH Keywords: bicriteria problems / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / 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: W2794831594 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1101.2360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for lawn mowing and milling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions and bounds for general art gallery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of geometric dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum watchman routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for TSP with neighborhoods in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon exploration with time-discrete vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Covering with Travel Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über dichteste Kreislagerung und dünnste Kreisüberdeckung / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Minimum covering with travel cost
scientific article

    Statements

    Minimum covering with travel cost (English)
    0 references
    0 references
    0 references
    0 references
    1 October 2012
    0 references
    covering
    0 references
    minimum Watchman problem
    0 references
    limited visibility
    0 references
    lawn mowing
    0 references
    bicriteria problems
    0 references
    approximation algorithm
    0 references
    PTAS
    0 references

    Identifiers