Online Semi-matching Problem with Two Heterogeneous Sensors in a Metric Space

Xiao, Man; Li, Weidong

doi:10.1007/978-3-031-22105-7_39

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2023

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Itoh et al [16] presented several lower bounds on the competitive ratio for this problem with different number of sensors. Xiao and Li [17] considered the semi-matching problem with two heterogeneous sensors, and proposed two optimal online algorithms.…”

Section: Introductionmentioning

confidence: 99%

Online Bottleneck Matching Problem with Two Heterogeneous Sensors in a Metric Space

Xiao

Yang

2022

Computation

Self Cite

View full text Add to dashboard Cite

In this paper, we consider the online matching problem with two heterogeneous sensors s1 and s2 in a metric space (X,d). If a request r is assigned to sensor s1, the service cost of r is the distance d(r,s1). Otherwise, r is assigned to sensor s2, and the service cost of r is d(r,s2)w, where w≥1 is the weight of sensor s2. The goal is to minimize the maximum matching cost, we design an optimal online algorithm with a competitive ratio of 1+w+1w for 1≤w≤1.839, and an optimal online algorithm with a competitive ratio of w+1+w2+6w+12 for w>1.839.

show abstract

Section: Introductionmentioning

confidence: 99%