Euclidean chains and their shortcuts (Q391221): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C62 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68U05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244094 / rank
 
Normal rank
Property / zbMATH Keywords
 
Euclidean graph
Property / zbMATH Keywords: Euclidean graph / rank
 
Normal rank
Property / zbMATH Keywords
 
computational geometry
Property / zbMATH Keywords: computational geometry / rank
 
Normal rank
Property / zbMATH Keywords
 
diameter
Property / zbMATH Keywords: diameter / 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.1016/j.tcs.2012.03.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155175290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on “algorithms for reporting and counting geometric intersections” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location and the geometric minimum-diameter spanning tree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Diameter Spanning Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:46, 7 July 2024

scientific article
Language Label Description Also known as
English
Euclidean chains and their shortcuts
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references