Skip to Main content Skip to Navigation
Conference papers

Temporal Matching on Geometric Graph Data

Abstract : Temporal graphs are the modeling of pairwise and historical interaction in recordings of a dataset. A temporal matching formalizes the planning of pair working sessions of a required duration. We depict algorithms finding temporal matchings maximizing the total workload, by an exact algorithm and an approximation. The exact algorithm is a dynamic programming solving the general case in O*((γ + 1) n) time, where n is the number of vertices, γ represents the desired duration of each pair working session, and O* only focuses on exponential factors. When the input data is embedded in an Euclidean space, called geometric data, our approximation is based on a new notion of temporal velocity. We revise a known notion of static density [van Leeuwen, 2009] and result in a polynomial time approximation scheme for temporal geometric graphs of bounded density. We confront our implementations to known opensource implementation.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03095671
Contributor : Binh-Minh Bui-Xuan Connect in order to contact the contributor
Submitted on : Wednesday, January 20, 2021 - 11:13:45 AM
Last modification on : Tuesday, March 23, 2021 - 9:28:02 AM

File

PNB21.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03095671, version 2

Citation

Timothe Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan. Temporal Matching on Geometric Graph Data. CIAC 2021 - 12th International Conference on Algorithms and Complexity, May 2021, Larnaca, Cyprus. ⟨hal-03095671v2⟩

Share

Metrics

Record views

86

Files downloads

65