DeepAI AI Chat
Log In Sign Up

Moving intervals for packing and covering

by   Rain Jiang, et al.

We study several problems on geometric packing and covering with movement. Given a family ℐ of n intervals of κ distinct lengths, and another interval B, can we pack the intervals in ℐ inside B (respectively, cover B by the intervals in ℐ) by moving τ intervals and keeping the other σ = n - τ intervals unmoved? We show that both packing and covering are W[1]-hard with any one of κ, τ, and σ as single parameter, but are FPT with combined parameters κ and τ. We also obtain improved polynomial-time algorithms for packing and covering, including an O(nlog^2 n) time algorithm for covering, when all intervals in ℐ have the same length.


page 1

page 2

page 3

page 4


Solving Packing Problems with Few Small Items Using Rainbow Matchings

An important area of combinatorial optimization is the study of packing ...

Min-Max Theorems for Packing and Covering Odd (u,v)-trails

We investigate the problem of packing and covering odd (u,v)-trails in a...

There is no APTAS for 2-dimensional vector bin packing: Revisited

We study vector bin packing and vector bin covering problems, multidimen...

Covering and packing with homothets of limited capacity

This work revolves around the two following questions: Given a convex bo...

Imperfect fifths pack into musical scales

Musical scales are used in cultures throughout the world, but the questi...

Approximation Schemes for Covering and Packing in the Streaming Model

The shifting strategy, introduced by Hochbaum and Maass, and independent...

Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems

Many combinatorial optimization problems such as the bin packing and mul...