z-logo
open-access-imgOpen Access
Don't Be Strict in Local Search!
Author(s) -
Serge Gaspers,
Eun Jung Kim,
Sebastian Ordyniak,
Saket Saurabh,
Stefan Szeider
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v26i1.8128
Subject(s) - local search (optimization) , parameterized complexity , combinatorial search , combinatorial optimization , set (abstract data type) , vertex cover , mathematics , vertex (graph theory) , beam search , class (philosophy) , computer science , guided local search , relaxation (psychology) , mathematical optimization , search algorithm , combinatorics , theoretical computer science , approximation algorithm , graph , artificial intelligence , psychology , social psychology , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom