Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110655989 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.3770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bounds for the Universal and a priori TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower and upper bounds for universal TSP in planar metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal approximations for TSP, Steiner tree, and set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions and limits to vertex sparsification / rank
 
Normal rank
Property / cites work
 
Property / cites work: AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem / rank
 
Normal rank

Latest revision as of 10:17, 4 July 2024

scientific article
Language Label Description Also known as
English
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs
scientific article

    Statements

    Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2011
    0 references

    Identifiers

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