Primal-dual approximation algorithms for a packing-covering pair of problems (Q3148377): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1051/ro:2002005 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163145578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-phase algorithms for throughput maximization for real-time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of an interval scheduling problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/RO:2002005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:17, 20 December 2024

scientific article
Language Label Description Also known as
English
Primal-dual approximation algorithms for a packing-covering pair of problems
scientific article

    Statements

    Primal-dual approximation algorithms for a packing-covering pair of problems (English)
    0 references
    0 references
    0 references
    28 November 2002
    0 references
    primal-dual
    0 references
    approximation algorithms
    0 references
    packing-covering
    0 references
    intervals
    0 references

    Identifiers

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