In this paper we examine the impact of tree schemas on some NP-complete problems. We show that tree schema instances can be efficiently solved (i.e., polynomially) for certain NP-complete proble...
The computational complexity of Two Dots has already been addressed in [Misra, FUN 2016], where it has been shown that the general version of the problem is NP-complete. Unfortunately, the known reductions produce Two Dots levels ... D Bilò,L Gualà,S Leucci,... 被引量: 0发表: 2018...
However, whether the special case 2-segmented channel routing remains NP-complete in the strong sense or not has not been proved. In this paper, we show that the 2-segmented channel routing problem remains strongly NP-complete, and thus an efficient optimal algorithm for this special case of ...
The yellow and orange backdrop of the sky shimmers and slowly rises revealing the sun. The head of a giraffe peaks out from the wings stage left to see what’s going on. And then the giraffe enters, tall, graceful, majestic, commanding and a puppet. Finding the person ‘in’ the puppe...
We present a number of simply-structured combinatorial games for which the problem of determining the outcome of optimal play is complete in polynomial space—a condition which gives very strong assurance that these problems are hard. In addition to proving this completeness property for some particul...
To overcome this problem, the chime- ric mice with only one type of mutant gene by genotyp- ing analysis of tail DNA should be selected for further functional analysis; and the same phenotype should be observed in multiple mice. Moreover, the overall effi- ciency of generating homogenous ...
Here, we present complete genome sequences of four Enterococcus faecium isolates, obtained from two patients with apparent vancomycin-resistant Enterococcus faecium bacteremia; these isolates also carried two mutations known to be associated with daptomycin resistance. Sequences were obtained using de novo...
Screenshots If applicable, add screenshots to help explain your problem. Desktop (please complete the following information): OS: [e.g. iOS] Windows 11 Browser [e.g. chrome, safari] Google Chrome Version 114.0.5735.199 (Official Build) (64-bit) ...
They show that the problem is NP-hard in the strong sense and present polynomial-time algorithms for two special cases of the problem. Steiner and Zhang (2009) study single-machine batch delivery scheduling with batch setup times, where the objective is to minimize the sum of the weighted ...
The Constrained Two-dimensional Guillotine Placement Problem (C2GPP) addresses a rectangular large object of length and width and a set of different rectangular small item types. Each item type i ∈ I has length li, width wi, value vi, and the maximum number of copies ui to be manufact...