logo
ProjectForthcoming

(Non)-Metric Embeddings

Sector: Education • Location: Israel

Source: EU Funding & Tenders Portal

"Many problems we face are naturally expressed in terms of distances. Rather than solving each one on an ad hoc basis, researchers have built a rich toolbox. Metric embeddings play a central role: points of a complex metric space are embedded into a simpler one (e.g., a tree metric or Euclidean space) while approximately preserving structure. This lets us solve the problem in the simple space—wher

Status
Prospective
Sector
Education, Road
Location
Israel
Updated
19 Nov 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about (Non)-Metric Embeddings

Pick a question to edit it, or write your own.

First answer free · no account

I am a

Project Information FAQ

Project Information

3 Q
The project “(Non)-Metric Embeddings” is an infrastructure initiative in the Education sector, located in Israel. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Not available for this record.

Status

Original status

forthcoming

Taiyo status

Prospective

Taiyo last update

2026-11-19

Contact

Not available for this record.

Description

Description

"Many problems we face are naturally expressed in terms of distances. Rather than solving each one on an ad hoc basis, researchers have built a rich toolbox. Metric embeddings play a central role: points of a complex metric space are embedded into a simpler one (e.g., a tree metric or Euclidean space) while approximately preserving structure. This lets us solve the problem in the simple space—where fast, well-understood algorithms exist—and then transfer solutions back. Metric embeddings have enabled breakthroughs for many different problems. However, many real networks are not metric. Problems with non-metric distances are considerably harder, and our current toolkit is quite limited. The overarching goal of this proposal is to develop a toolkit for non-metric distance problems and apply it to advance multiple core tasks. The guiding idea of embeddings is to impose more ""structure"" on the input space. Completely general distances are notoriously intractable, so we target non-metrics that have some structure: (1) Quasimetrics — shortest-path distances in directed graphs (lacking symmetry). We will develop tools such as stochastic embeddings into DAGs, locality-sensitive partial orderings, and directed low-diameter decompositions, with special focus on realistic instances that have additional structure (e.g., small highway dimension). Expected impact includes faster directed shortest paths, improved sparsest-cut approximations, compact routing, asymmetric TSP, and beyond. (2) Hop-constrained (h.c.) distances — the u–v distance is the minimum-weight path using at most h hops. H.c. distances are important for increased reliability and lower latency. We will study stochastic embeddings into trees, embeddings into spanning trees, and embeddings of topologically structured graphs into low-treewidth graphs. Expected impact includes better (non-h.c.) oblivious routing, distributed universal optimality, h.c. compact routing, and more."

Location

Country

Israel

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Education, Road

Article published date

2026-09-01

More on this project

Research

Free account

View all details

You are reading the public part. A free account opens the rest:

  • Every detail on this project
  • News and media coverage
  • Technical research
View all details

Free account · no card · lands you back on this project