New Bounds for the Snake-in-the-Box Problem
نویسندگان
چکیده
The Snake-in-the-Box problem is that of finding a longest induced path in an n-dimensional hypercube. We prove new lower bounds for the values n ∈ {11, 12, 13}. The Coil-in-the-Box problem is that of finding a longest induced cycle in an n-dimensional hypercube. We prove new lower bounds for the values n ∈ {12, 13}.
منابع مشابه
New Lower Bounds for the Snake-in-the-Box Problem: Using Evolutionary Techniques to Hunt for Snakes
The snake-in-the-box problem is a difficult problem in mathematics and computer science that was first described by Kautz in the late 1950’s (Kautz 1958). Snake-in-the-box codes have many applications in electrical engineering, coding theory, and computer network topologies. Generally, the longer the snake for a given dimension, the more useful it is in these applications (Klee 1970). By applyi...
متن کاملBuilding Snakes from Dna – a Step towards Generalizing the Snake in the Box Problem
The snake in the box problem is an NP-hard problem which has been a challenging problem for both computer scientists and mathematicians. It aims to maximize certain types of paths (snakes) in a graph, an n-dimensional hypercube while satisfying certain constraints described using the concept of spread. This thesis identifies a common pattern among the longest snakes which is very similar to the...
متن کاملDetermining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملStability for certain subclasses of harmonic univalent functions
In this paper, the problem of stability for certain subclasses of harmonic univalent functions is investigated. Some lower bounds for the radius of stability of these subclasses are found.
متن کاملThe DNA of Snakes
The Snake in the Box problem is an NP-Hard problem. The goal is to find the longest maximal snakes (a certain kind of path satisfying particular constraints described as “spread”) in an n-dimensional hypercube [8]. With increasing dimensions the search space grows exponentially and the search for snakes becomes more and more difficult. This article identifies an underlying pattern among the kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1603.05119 شماره
صفحات -
تاریخ انتشار 2016