scientific article; zbMATH DE number 7758347

DOI10.4230/lipics.approx/random.2020.45arXiv2004.13202MaRDI QIDQ6084404

Anastasios Sidiropoulos, Unnamed Author, Unnamed Author, Unnamed Author, Neshat Mohammadi, Diego Ihara

Publication date: 31 October 2023

Full work available at URL: https://arxiv.org/abs/2004.13202

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmsmetric learningordinal constraintsembedding into the line

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple linear time approximation algorithm for betweenness
• Approximation algorithms for minimizing average distortion
• Hardness of fully dense problems
• Metric Learning: A Survey
• Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
• Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
• On average distortion of embedding metrics into the line and into L ₁
• Low-distortion embeddings of general metrics into the line
• Distortion Is Fixed Parameter Tractable
• Total Ordering Problem
• A Geometric Approach to Betweenness
• A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs
• Ordinal embeddings of minimum relaxation

This page was built for publication: