AI Chat AI Image Generator AI Video Text to Speech

A Tight Lower Bound for Compact Set Packing

02/18/2023

∙

by Huairui Chu, et al.

∙

∙

This note is devoted to show a simple proof of a tight lower bound of the parameterized compact set packing problem, based on ETH.

page 1

page 2

research

∙ 11/23/2018

A lower bound for online rectangle packing

We slightly improve the known lower bound on the asymptotic competitive ...

0 Leah Epstein, et al. ∙

research

∙ 06/06/2013

Tight Lower Bound on the Probability of a Binomial Exceeding its Expectation

We give the proof of a tight lower bound on the probability that a binom...

0 Spencer Greenberg, et al. ∙

research

∙ 07/04/2022

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set

We study the Escape Problem for discrete-time linear dynamical systems o...

0 Julian D'Costa, et al. ∙

research

∙ 02/19/2019

A Tight Lower Bound for Index Erasure

The Index Erasure problem asks a quantum computer to prepare a uniform s...

0 Nathan Lindzey, et al. ∙

research

∙ 12/19/2017

A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game

We prove a tight lower bound on the asymptotic performance ratio ρ of th...

0 Y. Kohayakawa, et al. ∙

research

∙ 07/29/2021

A tight lower bound for the online bounded space hypercube bin packing problem

In the d-dimensional hypercube bin packing problem, a given list of d-di...

0 Yoshiharu Kohayakawa, et al. ∙

research

∙ 10/18/2022

Capacitated Vehicle Routing in Graphic Metrics

We study the capacitated vehicle routing problem in graphic metrics (gra...

0 Tobias Mömke, et al. ∙