NP-hard - PDFSEARCH.IO - Document Search Engine

NP-hard
Results: 119

#	Item
21	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:55 Complexity classes NP-hardness NP P versus NP problem Computational complexity theory P Reduction
22	Distance Three Labelings of Trees∗ Jiˇr´ı Fiala† Petr A. Golovach‡ Bernard Lidick´ Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:45:05 NP-complete problems Graph coloring NP-hard problems Graph theory Planar graphs Treewidth Graph Independent set Tree decomposition Outerplanar graph Tree Graph labeling
23	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP∗ Matthias Englert Heiko R¨oglin Add to Reading List Source URL: www.dcs.warwick.ac.uk Language: English - Date: 2008-09-04 11:36:22 NP-hard problems NP-complete problems Operations research Travelling salesman problem Gadget Graph
24	DISCRETE APPLIED MATHEMATICS ELSEYIER Discrete Applied Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2010-06-13 16:41:26 Graph theory Mathematics NP-complete problems NP-hard problems Graph coloring Routing algorithms Search algorithms Hamiltonian path Bipartite graph Travelling salesman problem A* search algorithm Planar separator theorem
25	The minimum feedback arc set problem is NP-hard for tournaments Pierre Charbit∗, St´ephan Thomass´e†and Anders Yeo‡ Abstract Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedba Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2011-08-22 06:36:01
26	Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching Nicol N. Schraudolph Add to Reading List Source URL: nic.schraudolph.org Language: English - Date: 2011-07-24 10:18:33
27	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2008-02-01 14:51:28 Computational complexity theory Theory of computation Complexity classes NP-complete problems Mathematical optimization NP-hard problems MAX-3SAT NP Approximation algorithm Probabilistically checkable proof PCP theorem APX
28	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-10-22 08:43:20 Graph theory Mathematics NP-complete problems NP-hard problems Operations research Travelling salesman problem Matching Eulerian path Hamiltonian path Minimum spanning tree Cycle Line graph
29	Special Issue on Artificial Intelligence Underpinning Golden Ball Algorithm for solving Flow Shop Scheduling Problem Fatima Sayoti, Mohammed Essaid Riffi LAROSERI Laboratory, Dept. of Computer Science, Faculty of Scienc Add to Reading List Source URL: www.ijimai.org Language: English - Date: 2016-03-29 07:56:34 Operations research Computational complexity theory Scheduling Mathematics Applied mathematics NP-hard problems Complexity classes Mathematical optimization Flow shop scheduling Makespan Combinatorial optimization Schedule
30	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition

UPDATE