VC-Dimension and Shortest Path Algorithms (Q3012843): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5417667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Routing in Road Networks with Transit Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability and Distance Queries via 2-Hop Labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Route Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting sets when the VC-dimension is small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank

Latest revision as of 06:51, 4 July 2024

scientific article
Language Label Description Also known as
English
VC-Dimension and Shortest Path Algorithms
scientific article

    Statements

    VC-Dimension and Shortest Path Algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 July 2011
    0 references
    0 references
    0 references