Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1

Source URL: robertmarks.org

comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

Source URL: www.cs.huji.ac.il

• Computational complexity theory
• Graph theory
• NP-complete problems
• Mathematics
• Travelling salesman problem
• Set TSP problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• APX
• Cut
• Time complexity

A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar

Source URL: www.cs.cmu.edu

• Graph theory
• Computational complexity theory
• Mathematics
• NP-complete problems
• Vertex cover
• Steiner tree problem
• Shortest path problem
• Linear programming
• Edge disjoint shortest pair algorithm
• Minimum bottleneck spanning tree

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

Source URL: www.cs.tau.ac.il

• Computational complexity theory
• Graph theory
• Mathematics
• Phylogenetics
• NP-complete problems
• Computational phylogenetics
• Analysis of algorithms
• Probabilistic complexity theory
• Randomized algorithm
• Steiner tree problem
• Algorithm
• Maximum parsimony

A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†

Source URL: theory.stanford.edu

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• Edsger W. Dijkstra
• Spanning tree
• Operations research
• Shortest path problem
• Graph
• Linear programming
• Steiner tree problem

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Source URL: theory.stanford.edu

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Steiner tree problem
• XTR
• Shortest path problem
• Flow network
• Maximum flow problem
• Graph coloring

O(n2 log n) implementation of an approximation for the Prize-Colle ting Steiner Tree Problem Paulo Feolo  Cristina G. Fernandes y

Source URL: www.ime.usp.br

• Finite fields
• XTR
• English orthography

Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,

Source URL: www.math.washington.edu

• Graph theory
• Computational complexity theory
• Mathematics
• Spanning tree
• NP-complete problems
• Approximation algorithms
• Steiner tree problem
• Complexity classes
• APX
• Combinatorial optimization
• Minimum spanning tree
• Cut

CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

Source URL: theory.stanford.edu

• Graph theory
• Mathematics
• Spanning tree
• Steiner tree problem
• Minimum spanning tree
• Shortest path problem
• Eulerian path
• Line graph
• Expected linear time MST algorithm
• Minimum bottleneck spanning tree

CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Source URL: theory.stanford.edu

• Mathematics
• Computational complexity theory
• Graph theory
• NP-complete problems
• Operations research
• Travelling salesman problem
• Theoretical computer science
• Approximation algorithm
• Steiner tree problem
• Greedy algorithm
• Optimization problem
• Set cover problem