Geometric partitioning and robust ad-hoc network design (Q271922): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B06 / 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: 6570936 / rank
 
Normal rank
Property / zbMATH Keywords
 
geometric partitioning
Property / zbMATH Keywords: geometric partitioning / rank
 
Normal rank
Property / zbMATH Keywords
 
network design
Property / zbMATH Keywords: network design / rank
 
Normal rank
Property / zbMATH Keywords
 
location set covering
Property / zbMATH Keywords: location set covering / rank
 
Normal rank
Property / zbMATH Keywords
 
vehicle routing
Property / zbMATH Keywords: vehicle routing / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank

Revision as of 16:42, 27 June 2023

scientific article
Language Label Description Also known as
English
Geometric partitioning and robust ad-hoc network design
scientific article

    Statements

    Geometric partitioning and robust ad-hoc network design (English)
    0 references
    0 references
    0 references
    0 references
    20 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric partitioning
    0 references
    network design
    0 references
    location set covering
    0 references
    vehicle routing
    0 references
    approximation algorithms
    0 references