NP-hard - PDFSEARCH.IO - Document Search Engine

NP-hard
Results: 119

#	Item
11	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
12	Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer Computer Engineering and Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:24 Computational complexity theory Graph theory Mathematics NP-complete problems Combinatorial optimization NP-hard problems Graph coloring Signal-to-interference-plus-noise ratio NC Open set Independent set Matching
13	CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2014-11-27 12:00:09 Computational complexity theory Mathematics Theory of computation Operations research NP-hard problems Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation NP Travelling salesman problem Gap reduction
14	The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-11-17 17:17:16 Mathematics Combinatorics Combinatorial optimization Matroid theory Discrete mathematics Matroid Greedoid Partition matroid Matroid oracle
15	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:58 Computational complexity theory Complexity classes Theory of computation NP P Reduction Time complexity
16	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
17	Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann Tobias Friedrich Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:47:38 Mathematical analysis Mathematics Approximation algorithms Polynomial-time approximation scheme Pi NP-hard problems -net
18	BERNSTEIN is NP hard A new representation for geometric sets Fractals and intervals Add to Reading List Source URL: raim2012.u-bourgogne.fr Language: English - Date: 2012-07-16 09:28:31 Constructible universe Operator theory
19	CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-01 15:15:38 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Operations research Combinatorial optimization NP-hard problems Online algorithm Steiner tree problem Minimum spanning tree Travelling salesman problem
20	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability

UPDATE