Maximum gradient embeddings and monotone clustering (Q1945290): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q610753
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Manor Mendel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040023987 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0606109 / 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: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / 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: On metric Ramsey-type phenomena / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiembedding of Metric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impossibility of dimension reduction in l <sub>1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the 0-Extension Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Combinatorial Algorithms for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the \(k\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the sum of cluster diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-stretch spanning trees / 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: Q4250234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts, trees and \(\ell_1\)-embeddings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Construction of Nets in Low-Dimensional Metrics and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the fault tolerant metric facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Local Search Heuristic for Facility Location Problems / 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: Q2756809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding the diamond graph in \(L_p\) and dimension reduction in \(L_1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Lipschitz functions via random metric partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean quotients of finite metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey partitions and proximity data structures / 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: Q4526991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471365 / rank
 
Normal rank

Latest revision as of 07:49, 6 July 2024

scientific article
Language Label Description Also known as
English
Maximum gradient embeddings and monotone clustering
scientific article

    Statements

    Maximum gradient embeddings and monotone clustering (English)
    0 references
    0 references
    0 references
    5 April 2013
    0 references
    embedding metric spaces into trees
    0 references
    maximum gradient embeddings
    0 references
    clustering problems with monotone costs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers