Salesman

Results: 438



#Item
41Graph 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

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
42NP-complete problems / Edsger W. Dijkstra / Spanning tree / Matroid theory / Operations research / Online algorithm / Steiner tree problem / Matroid / Shortest path problem / Algorithm / Travelling salesman problem / Greedy algorithm

CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-01-04 19:18:44
43C POSIX library / System calls / File locking / Write / Readerswriter lock / XC / Travelling salesman problem / Stat / Open / Inode

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGYDistributed System Engineering: SpringQuiz I Solutions

Add to Reading List

Source URL: nil.csail.mit.edu

Language: English - Date: 2015-01-05 06:37:34
44NP-complete problems / Clique problem / Vertex cover / Clique / Independent set / Bipartite graph / Travelling salesman problem / Graph coloring / Line graph / Treewidth / Pathwidth

Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Add to Reading List

Source URL: www.levreyzin.com

Language: English - Date: 2016-07-01 10:19:11
45NP-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

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
46Cybernetics / Operations research / Mathematical optimization / Ant colony optimization algorithms / Search algorithms / Genetic algorithm / Travelling salesman problem / Evolutionary algorithm / Algorithm / Big O notation

Computational Complexity of Ant Colony Optimization and Its Hybridization Frank Neumann1 , Dirk Sudholt2⋆ , and Carsten Witt3⋆ 1 Max-Planck-Institut f¨

Add to Reading List

Source URL: ls2-www.cs.tu-dortmund.de

Language: English - Date: 2009-04-06 09:15:22
47Graph theory / Degree / Multigraph / Eulerian path / Directed graph / Bipartite graph / Graph / Travelling salesman problem / Matching

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One Markus Bl¨ aser Institut f¨ ur Theoretische Informatik, ETH Z¨

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2013-08-22 13:00:35
48Operations research / Approximation algorithm / Randomized rounding / Greedy algorithm / Algorithm / Relaxation / Combinatorial auction / Price of anarchy / Linear programming / Travelling salesman problem / Integer programming / Semidefinite programming

Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING, ETH Z¨ urich

Add to Reading List

Source URL: paulduetting.com

Language: English - Date: 2015-12-11 02:28:02
49Punctuation / Semicolon / Comma / Death of a Salesman / Apostrophe / All My Sons / Willy Loman / Loman / Essay / Wit / Colon / Ibsen

This guide was last updated on 5 Augusthttp://www.thepequod.org.uk/ Essay Writing – Some Common Mistakes

Add to Reading List

Source URL: www.thepequod.org.uk

Language: English - Date: 2012-08-05 05:58:35
50Genetic algorithms / Chromosome / Mutation / Travelling salesman problem / Evolution / Heuristic / Algorithm

International Journal of Computer Science and Applications, Technomathematics Research Foundation Vol. 13, No. 2, pp. 16 – 28, 2016 A NEW METHOD OF EXPLORING A RANGE OF GENETIC PARAMETERS DURING THE EXECUTION OF A G

Add to Reading List

Source URL: www.tmrfindia.org

Language: English
UPDATE