Priority algorithms for the subset-sum problem (Q1029701): 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-007-9126-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2919974563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of priority algorithms for facility location and set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / 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: (Incremental) priority algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling equal-length jobs to maximize throughput / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval selection: Applications, algorithms, and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / 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: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fully polynomial approximation scheme for the Subset-Sum problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority algorithms for makespan minimization in the subset model. / rank
 
Normal rank

Latest revision as of 19:22, 1 July 2024

scientific article
Language Label Description Also known as
English
Priority algorithms for the subset-sum problem
scientific article

    Statements

    Priority algorithms for the subset-sum problem (English)
    0 references
    0 references
    0 references
    13 July 2009
    0 references
    0 references
    greedy
    0 references
    approximation algorithm
    0 references
    revocable acceptance
    0 references
    0 references