<--- Back to Details
First PageDocument Content
NP-complete problems / Art gallery problem / Steiner tree problem / Vertex / Connectivity / Pseudotriangle / Tree / Graph / Dominating set / Graph theory / Mathematics / Theoretical computer science
Date: 2010-07-19 10:46:19
NP-complete problems
Art gallery problem
Steiner tree problem
Vertex
Connectivity
Pseudotriangle
Tree
Graph
Dominating set
Graph theory
Mathematics
Theoretical computer science

cccg-cluster_visibility-2.dvi

Add to Reading List

Source URL: cccg.ca

Download Document from Source Website

File Size: 133,07 KB

Share Document on Facebook

Similar Documents

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

DocID: 1tff1 - View Document

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

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

DocID: 1rc9S - View Document

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

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

DocID: 1r7hn - View Document

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

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

DocID: 1qRse - View Document

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

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

DocID: 1qObK - View Document