DeepAI AI Chat
Log In Sign Up

Moving intervals for packing and covering

09/01/2021
by   Rain Jiang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/06/2020

Solving Packing Problems with Few Small Items Using Rainbow Matchings

An important area of combinatorial optimization is the study of packing ...
08/23/2017

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...
04/27/2021

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

We study vector bin packing and vector bin covering problems, multidimen...
11/17/2022

Covering and packing with homothets of limited capacity

This work revolves around the two following questions: Given a convex bo...
06/13/2019

Imperfect fifths pack into musical scales

Musical scales are used in cultures throughout the world, but the questi...
06/29/2017

Approximation Schemes for Covering and Packing in the Streaming Model

The shifting strategy, introduced by Hochbaum and Maass, and independent...
10/10/2011

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

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