Results 81 to 90 of about 996,556 (196)

Maximum independent set and maximum clique algorithms for overlap graphs

Discrete Applied Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eowyn Cenek, Lorna Stewart
openaire   +2 more sources

Resource assignments algorithm based on energy efficiency optimization in OFDM relay networks

Tongxin xuebao, 2015
In cooperative orthogonal frequency division multiplexing (OFDM) systems, the resource allocation rationally is significant to enhance the system performance. Aiming at maximizing the total system energy efficiency, the joint as-signment problem of relay,
Yun LI, Hai-xia DUAN, Kai-rong SU, Bin CAO   +3 more
doaj   +2 more sources

A Genetic Algorithm for the Maximum 2–Packing Set Problem

International Journal of Applied Mathematics and Computer Science, 2020
Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality.
Trejo-Sánchez Joel Antonio, Fajardo-Delgado Daniel, Gutierrez-Garcia J. Octavio   +2 more
doaj   +1 more source

Using Critical Sets to Solve the Maximum Independent Set Problem

, 2008
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent set is developed.
Svyatoslav Trukhanov, Sergiy Butenko
core  

Constructive-non-constructive approximation and maximum independent set problem

, 1996
We apply in the case of the maximum independent set, a general thought process consisting in integrating an information on the optimal objective value in its instance.
Vangelis Th. Paschos, Paschos, Vangelis, Demange, Marc, Marc Demange   +3 more
core   +1 more source

Maximum Independent Set of Rectangles [PDF]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Parinya Chalermsook, Julia Chuzhoy
openaire   +1 more source

A priori optimization for the probabilistic maximum independent set problem

, 2002
We first propose a formal definition for the concept of probabilistic combinatorial optimization problem (under the a priori method). Next, we study the complexity of optimally solving probabilistic maximum independent set problem under several a priori ...
Cécile Murat, Vangelis Th. Paschos, Paschos, Vangelis Th., Paschos, Vangelis, Murat, Cécile   +4 more
core   +1 more source

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes

, 2005
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka, Miroslav Chlebík, Chlebik, Miroslav, Miroslav Chlebik (4461319), Janka Chlebíková, Janka Chlebíková (16060964)   +5 more
core  

A New and Fast Approximation Algorithm for Vertex Cover Using a Maximum Independent Set (VCUMI)

Operations Research and Decisions, 2015
The importance of non-deterministic polynomial (NP) problems in real world scenarios has compelled researchers to consider simple ways of finding approximate solutions to these problems in polynomial time.
Imran Khan, Naveed Riaz
doaj  

Efficient identification of maximum independent sets in stochastic multilayer graphs with learning automata

Results in Engineering
Investigating the maximum independent set in stochastic multilayer graphs provides critical insights into the structural and dynamical properties of complex networks. Recently, stochastic multilayer graphs effectively model the intricate interactions and
Mohammad Mehdi Daliri Khomami, Mohammad Reza Meybodi, Alireza Rezvanian   +2 more
doaj   +1 more source