An efficient noisy binary search in graphs via Median approximation (Q2115863): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highway Dimension and Provably Efficient Shortest Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching with lies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching a Tree with Permanently Noisy Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison-based search in the presence of errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on approximate 1-median selection in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5351928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twenty (simple) questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary search in graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking and searching in partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and probabilistic binary search in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with Noisy Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear time algorithms for metric space problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coping with errors in binary search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centrality index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part I: The <i>p</i>-Center and <i>p</i>-Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4121861 / rank
 
Normal rank

Latest revision as of 09:30, 28 July 2024

scientific article
Language Label Description Also known as
English
An efficient noisy binary search in graphs via Median approximation
scientific article

    Statements

    An efficient noisy binary search in graphs via Median approximation (English)
    0 references
    22 March 2022
    0 references
    graph median
    0 references
    graph searching
    0 references
    noisy search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers