We investigate the computational complexity of two closely related classes of combinatorial
optimization problems for linear systems which arise in various fields such as machine …

Four fundamental graph problems, Minimum vertex cover, Maximum independent set,
Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic …

Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present
simple and provably good heuristics for a number of classical NP‐hard optimization …

Due to the fact that no NP-complete problem can be solved in polynomial time (unless P=
NP), many approximability results (both positive and negative) of NP-hard optimization …

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 …

Four fundamental graph problems, Minimum vertex cover, Maximum independent set,
Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic …

We study the minimum spanning tree problem, the maximum matching problem and the
shortest path problem subject to binary disjunctive constraints: A negative disjunctive …

This paper describes an application of the quantum approximate optimisation algorithm
(QAOA) to efficiently find approximate solutions for computational problems contained in the …

We consider the problem of approximating the size of a minimum non-extendible
independent set of a graph, also known as the minimum dominating independence number …

Principles of Ad Hoc Networking presents a systematic introduction to the fundamentals of
ad hoc networks. An ad-hoc network is a small network, especially one with wireless or …