Hardness and approximation of minimum distortion embeddings (Q991793): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2921660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear discrepancy and bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low distortion maps between point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the bandwidth for asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination on Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal greedy heuristic to color interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of minimum spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839788 / rank
 
Normal rank

Latest revision as of 04:41, 3 July 2024

scientific article
Language Label Description Also known as
English
Hardness and approximation of minimum distortion embeddings
scientific article

    Statements

    Hardness and approximation of minimum distortion embeddings (English)
    0 references
    0 references
    0 references
    7 September 2010
    0 references
    0 references
    distortion
    0 references
    computational complexity
    0 references
    approximation
    0 references
    0 references