On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier

05/06/2018
by   Carlo Comin, et al.
0

In 2005 Kumar studied the Restricted Disjunctive Temporal Problem (RDTP), a restricted but very expressive class of disjunctive temporal problems (DTPs). It was shown that that RDTPs are solvable in deterministic strongly-polynomial time by reducing them to the Connected Row-Convex (CRC) constraints problem; plus, Kumar devised a randomized algorithm whose expected running time is less than that of the deterministic one. Instead, the most general form of DTPs allows for multi-variable disjunctions of many interval constraints and it is NP-complete. This work offers a deeper comprehension on the tractability of RDTPs, leading to an elementary deterministic strongly-polynomial time algorithm for them, significantly improving the asymptotic running times of both the deterministic and randomized algorithms of Kumar. The result is obtained by reducing RDTPs to the Single-Source Shortest-Paths (SSSP) and the 2-SAT problem (jointly), instead of reducing to CRCs. In passing, we obtain a faster (quadratic-time) algorithm for RDTPs having only Type-1 and Type-2 constraints (and no Type-3 constraint). As a second main contribution, we study the tractability frontier of solving RDTPs by considering Hyper Temporal Networks (), a strict generalization of grounded on hypergraphs: on one side, we prove that solving temporal problems having either only multi-tail or only multi-head hyperarc constraints and Type-2 constraints, it lies in both NP and co-NP and it admits deterministic pseudo-polynomial time algorithms; on the other side, solving problems with either only multi-tail or only multi-head hyperarc constraints and Type-3 constraints, it turns strongly NP-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2018

Non-Interlaced SAT is in P

We investigate the NP-Complete problem SAT and the geometry of its insta...
research
12/05/2018

On the Complexity Landscape of Connected f -Factor Problems

Let G be an undirected simple graph having n vertices and let f be a fun...
research
04/07/2021

On Salum's Algorithm for X3SAT

This is a commentary on, and critique of, Latif Salum's paper titled "Tr...
research
07/22/2011

Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries

Symmetries occur naturally in CSP or SAT problems and are not very diffi...
research
03/13/2015

Hyper Temporal Networks

Simple Temporal Networks (STNs) provide a powerful and general tool for ...
research
08/13/2021

A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method

The Quickest Transshipment Problem is to route flow as quickly as possib...
research
05/04/2022

The College Application Problem

This paper considers the maximization of the expected maximum value of a...

Please sign up or login with your details

Forgot password? Click here to reset