Combination of parallel machine scheduling and vertex cover (Q690471): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2112504072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / 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: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local ratio with negative weights. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approximation algorithm for node-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The primal-dual method for approximation algorithms / rank
 
Normal rank

Latest revision as of 22:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Combination of parallel machine scheduling and vertex cover
scientific article

    Statements

    Combination of parallel machine scheduling and vertex cover (English)
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    approximation algorithm
    0 references
    combination of optimizations
    0 references
    local ratio
    0 references
    LPT
    0 references
    scheduling
    0 references
    vertex cover
    0 references

    Identifiers

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