Towards the Solution of NP Complete Problems

Towards the Solution of NP Complete Problems

The word algorithm is the magical word in the field of computer science because the imagination of the existence of any branch of computer science like artificial intelligence, computer network, human computer interaction etc. is useless without the word algorithm. There are some problems for which...

Full description

Bibliographic Details
Main Authors:	Amit Kumar, Pawan Jindal
Format:	Article
Language:	English
Published:	Stefan cel Mare University of Suceava 2010-01-01
Series:	Journal of Applied Computer Science & Mathematics
Subjects:	Approximation algorithms NP complete problems
Online Access:	http://jacs.usv.ro/getpdf.php?issue=9&paperid=910

Similar Items

A Modified Heuristic Procedure for NP-Complete Problems Supported by Genetic Algorithms
by: Najla Al-Saati
Published: (2004-05-01)

Research of NP-Complete Problems in the Class of Prefractal Graphs
by: Rasul Kochkarov
Published: (2021-10-01)

Embedding and NP-complete Problems for Some Equitable Labelings
by: Samir K. VAIDYA, et al.
Published: (2014-10-01)

The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
by: Bo Moon
Published: (2012-01-01)

The Internet Shopping Optimization Problem with Multiple Item Units (ISHOP-U): Formulation, Instances, NP-Completeness, and Evolutionary Optimization
by: Fernando Ornelas, et al.
Published: (2022-07-01)

The complexity of cost constrained vehicle scheduling problem
by: Malihe Niksirat, et al.
Published: (2021-02-01)

NP-completeness of weakly convex and convex dominating set decision problems
by: Joanna Raczek
Published: (2004-01-01)

Complexity of Solutions Combination for the Three-Index Axial Assignment Problem
by: Lev G. Afraimovich, et al.
Published: (2022-03-01)

Safe Approximation—An Efficient Solution for a Hard Routing Problem
by: András Faragó, et al.
Published: (2021-02-01)

As good as it gets: a scaling comparison of DNA computing, network biocomputing, and electronic computing approaches to an NP-complete problem
by: Ayyappasamy Sudalaiyadum Perumal, et al.
Published: (2021-01-01)

MPF Problem over Modified Medial Semigroup Is NP-Complete
by: Eligijus Sakalauskas, et al.
Published: (2018-11-01)

A Heuristic Solution to the Closest String Problem Using Wave Function Collapse Techniques
by: Shirley Xu, et al.
Published: (2022-01-01)

Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time
by: Hongjun Wei, et al.
Published: (2019-09-01)

Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
by: Salvatore Mandrà, et al.
Published: (2016-01-01)

Two railway circuits: a universal circuit and an NP-difficult one
by: Maurice Margenstern
Published: (2001-05-01)

Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
by: Michael Haythorpe
Published: (2016-12-01)

An optimization approach for the satisfiability problem
by: S. Noureddine
Published: (2015-01-01)

Ising formulations of many NP problems
by: Andrew eLucas
Published: (2014-02-01)

P, NP, and NP-completeness : the basics of computational complexity /
by: 457465 Goldreich, Oded
Published: (c201)

NP-Completeness Results for Minimum Planar Spanners
by: Ulrik Brandes, et al.
Published: (1998-01-01)

An Algebraic Approach to the Solutions of the Open Shop Scheduling Problem
by: Agustín Moreno Cañadas, et al.
Published: (2023-05-01)

Computational Complexity of Some Problems on Generalized Cellular Automations
by: P. G. Klyucharev
Published: (2012-03-01)

Edit Distance with Block Deletions
by: Dana Shapira, et al.
Published: (2011-03-01)

An overview on polynomial approximation of NP-hard problems
by: Paschos Vangelis Th.
Published: (2009-01-01)

Approximation algorithms for NP-hard problems /
by: Hochbaum, Dorit (Dorit S.)
Published: (1997)

The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation
by: Milos Seda
Published: (2023-10-01)

Approximation algorithms for multi-multiway cut and multicut problems on directed graphs
by: Ramin Yarinezhad, et al.
Published: (2020-09-01)

A Sublinear Sudoku Solution in cP Systems and its Formal Verification
by: Yezhou Liu, et al.
Published: (2021-04-01)

Combinatorial optimization of permutation-based quadratic assignment problem using optics inspired optimization
by: Soheila Badrloo, et al.
Published: (2019-12-01)

A Swap-Based Heuristic Algorithm for the Maximum <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Plex Problem
by: Sun-Yuan Hsieh, et al.
Published: (2019-01-01)

Design of network-based biocomputation circuits for the exact cover problem
by: Till Korten, et al.
Published: (2021-01-01)

Identification Conditions for the Solvability of NP-complete Problems for the Class of Pre-fractal Graphs
by: Aleksandr Vasil'evich Tymoshenko, et al.
Published: (2021-06-01)

Task scheduling in cloud environment: optimization, security prioritization and processor selection schemes
by: Tao Hai, et al.
Published: (2023-01-01)

NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem
by: Natalya Sergeevna Medvedeva, et al.
Published: (2019-09-01)

NP-Hardness of the Problem of Optimal Box Positioning
by: Alexei V. Galatenko, et al.
Published: (2019-08-01)

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
by: Nesrine Abbas, et al.
Published: (2005-01-01)

Logarithmic SAT Solution with Membrane Computing
by: Radu Nicolescu, et al.
Published: (2022-02-01)

A Field-Theoretical Approach to the P vs. NP Problem via the Phase Sign of Quantum Monte Carlo
by: Andrei T. Patrascu
Published: (2017-10-01)

On Np-spaces in the ball
by: Khoi, Le Hai
Published: (2020)

Optimizing the Resource Consumption of Blockchain Technology in Business Systems
by: Juričić Vedran, et al.
Published: (2020-11-01)