An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Visibility and intersection problems in plane geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The zookeeper route problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal shortest path queries in a simple polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new data structure for shortest path queries in a simple polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5501793 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3799261 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4945523 / rank | |||
Normal rank |
Latest revision as of 15:35, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An O\((n\log n)\) algorithm for the zoo-keeper's problem |
scientific article |
Statements
An O\((n\log n)\) algorithm for the zoo-keeper's problem (English)
0 references
28 April 2003
0 references
shortest paths
0 references
zoo-keeper's problem
0 references
floodlight tree
0 references
0 references