Computing a consensus trajectory in a vehicular network (Q2091112): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-022-00909-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4297023170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Comparing Genomes with Duplicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding similar regions in many sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at the degree constrained subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization for the hazardous materials transportation network design problem / rank
 
Normal rank

Latest revision as of 17:14, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing a consensus trajectory in a vehicular network
scientific article

    Statements

    Computing a consensus trajectory in a vehicular network (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 October 2022
    0 references
    consensus trajectory
    0 references
    NP-hardness
    0 references
    approximation algorithm
    0 references
    heuristic algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references