Computing a consensus trajectory in a vehicular network
From MaRDI portal
Publication:2091112
DOI10.1007/s10878-022-00909-3zbMath1505.90033OpenAlexW4297023170MaRDI QIDQ2091112
Peng Zou, Letu Qingge, Binhai Zhu, Qing Yang
Publication date: 31 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00909-3
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Another look at the degree constrained subgraph problem
- Finding similar regions in many sequences
- Robust optimization for the hazardous materials transportation network design problem
- Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
- On the Approximability of Comparing Genomes with Duplicates
This page was built for publication: Computing a consensus trajectory in a vehicular network