Colored range closest-pair problem under general distance functions | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Colored range closest-pair problem under general distance functions

Identifier:nobleid.org/w1/20260515/8DCEFEC5

Type:Preprint

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/8DCEFEC5.svg?ark=w1%2F20260515%2F8DCEFEC5)](https://nobleid.org/work/w1/20260515/8DCEFEC5)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy