AI Chat AI Image Generator AI Video Text to Speech

The Packed Interval Covering Problem is NP-complete

06/09/2019

∙

by Abdallah Saffidine, et al.

∙

∙

We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.

Abdallah Saffidine
10 publications
Sébastien Lê Cong
1 publication
Sophie Pinchinat
7 publications
François Schwarzentruber
11 publications

page 1

page 2

page 3

page 4

research

∙ 03/13/2022

Maximum cut on interval graphs of interval count two is NP-complete

We show that the Max-Cut problem is NP-complete on interval graphs of in...

0 Alexey Barsukov, et al. ∙

research

∙ 02/15/2018

On the P vs NP question: a proof of inequality

The analysis discussed in this paper is based on a well-known NP-complet...

0 Angelo Raffaele Meo, et al. ∙

research

∙ 07/09/2020

Dota Underlords game is NP-complete

In this paper, we demonstrate how the problem of the optimal team choice...

0 Alexander A. Ponomarenko, et al. ∙

research

∙ 06/04/2018

Covering with Clubs: Complexity and Approximability

Finding cohesive subgraphs in a network is a well-known problem in graph...

0 Riccardo Dondi, et al. ∙

research

∙ 04/24/2013

Decision-Theoretic Troubleshooting: Hardness of Approximation

Decision-theoretic troubleshooting is one of the areas to which Bayesian...

0 Václav Lín, et al. ∙

research

∙ 09/21/2013

The multi-vehicle covering tour problem: building routes for urban patrolling

In this paper we study a particular aspect of the urban community polici...

0 Washington Alves de Oliveira, et al. ∙

research

∙ 01/05/2018

On randomized counting versus randomised decision

We study the question of which counting problems admit f.p.r.a.s., under...

0 Eleni Bakali, et al. ∙