Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474): 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.2007.02.064 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155224464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the General Mixed Packing and Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination Complexity of Parallel Price-Directive Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Max-Min Resource Sharing for Structured Concave Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the general max-min resource sharing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithm for the Mixed Fractional Packing and Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886046 / rank
 
Normal rank

Latest revision as of 20:43, 25 June 2024

scientific article
Language Label Description Also known as
English
Faster and simpler approximation algorithms for mixed packing and covering problems
scientific article

    Statements

    Faster and simpler approximation algorithms for mixed packing and covering problems (English)
    0 references
    0 references
    0 references
    6 June 2007
    0 references
    approximation algorithm
    0 references
    linear and convex programming
    0 references
    optimization
    0 references
    packing and covering problem
    0 references
    Lagrangian decomposition
    0 references
    logarithmic potential
    0 references

    Identifiers