Shrinking maxima, decreasing costs: New online packing and covering problems

Keyphrases

• Covering Problem 100%
• Online Packing 100%
• Packing Problem 100%
• Communication Networks 33%
• Competitive Ratio 33%
• Information Units 33%
• Online Fashion 33%
• Non-negative Integer 33%
• Overflow Model 33%
• General Matrix 33%
• Knapsack Constraint 33%
• Integer Programming 33%
• Team Formation 33%
• Buffer Overflow 33%
• Number of Sets 33%

Mathematics

• Packing Problem 100%
• Matrix (Mathematics) 100%
• Covering Problem 100%
• Integer 50%
• Competitive Ratio 50%
• Lower and upper bounds 50%
• Nonnegative Integer 50%
• Considered Problem 50%
• Total Cost 50%

Computer Science

• Packing Problem 100%
• Multiple Packet 50%
• Communication Network 50%
• Knapsack 50%
• Information Unit 50%
• Integer Program 50%
• Buffer Overflow 50%
• Competitive Ratio 50%
• Nonnegative Integer 50%
• Considered Problem 50%