A bicriterion approach for routing problems in multimedia networks (Q4419277): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W1994048062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the ranking of shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational improvement for a shortest paths ranking algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for ranking paths that may contain cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicriteria shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank

Latest revision as of 17:57, 5 June 2024

scientific article; zbMATH DE number 1958280
Language Label Description Also known as
English
A bicriterion approach for routing problems in multimedia networks
scientific article; zbMATH DE number 1958280

    Statements

    A bicriterion approach for routing problems in multimedia networks (English)
    0 references
    0 references
    31 July 2003
    0 references
    path ranking
    0 references
    bicriterion shortest path
    0 references
    multimedia network
    0 references
    routing problems
    0 references

    Identifiers

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