Approximation algorithms and relaxations for a service provision problem on a telecommunication network (Q1399109): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Adaptive Video on Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility in transportation networks with supply eating arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling aspects of distributed processing in telecommunication networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:36, 5 June 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms and relaxations for a service provision problem on a telecommunication network
scientific article

    Statements

    Approximation algorithms and relaxations for a service provision problem on a telecommunication network (English)
    0 references
    0 references
    0 references
    0 references
    30 July 2003
    0 references
    distributed processing networks
    0 references
    telecommunication
    0 references
    service provision
    0 references
    approximation algorithms
    0 references
    worst-case analysis
    0 references
    LP relaxation
    0 references
    knapsack problem
    0 references

    Identifiers

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