Deploying uncrewed aerial vehicles (UAVs) as aerial base stations (BSs) to assist terrestrial connectivity has drawn significant attention in recent years. Alongside other UAV types …
The maximum clique problem is a classical problem in combinatorial optimization which finds important applications in different domains. In this paper we try to give a survey of …
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
R Battiti, M Protasi - Algorithmica, 2001 - Springer
A new Reactive Local Search (\RLS) algorithm is proposed for the solution of the Maximum- Clique problem.\RLS is based on local search complemented by a feedback (history …
GJ Woeginger - INFORMS Journal on Computing, 2000 - pubsonline.informs.org
We derive results of the following flavor: If a combinatorial optimization problem can be formulated via a dynamic program of a certain structure and if the involved cost and …
E Amaldi, V Kann - Theoretical computer science, 1995 - Elsevier
We study the combinatorial problem which consists, given a system of linear relations, of finding a maximum feasible subsystem, that is a solution satisfying as many relations as …
P Crescenzi - Proceedings of Computational Complexity …, 1997 - ieeexplore.ieee.org
Comparing the complexity of different combinatorial optimization problems has been an extremely active research area during the last 23 years. This has led to the definition of …
S Khanna, R Motwani, M Sudan, U Vazirani - SIAM Journal on Computing, 1998 - SIAM
We attempt to reconcilethe two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have …
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The …