A tight bound on approximating arbitrary metrics by tree metrics (Q5917578): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.jcss.2004.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3030774092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online tracking of mobile users / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating min-sum <i>k</i> -clustering in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lipschitz embedding of finite metric spaces in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better algorithms for unfair metrical task systems and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive concurrent distributed queuing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors, network decomposition, and multicommodity flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classification problems with pairwise relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating planar metrics by tree metrics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measured descent: A new embedding method for finite metrics / 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: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the distortion of embedding planar metrics into Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the distortion of embedding finite metric spaces in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250159 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:20, 7 June 2024

scientific article; zbMATH DE number 2116233
Language Label Description Also known as
English
A tight bound on approximating arbitrary metrics by tree metrics
scientific article; zbMATH DE number 2116233

    Statements

    A tight bound on approximating arbitrary metrics by tree metrics (English)
    0 references
    18 November 2004
    0 references
    0 references
    Metrics
    0 references
    Embeddings
    0 references
    Tree Metrics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references