Find link

language:

Find link is a tool written by Edward Betts.

searching for Steiner tree problem 10 found (36 total)

K-minimum spanning tree (1,057 words) [view diff] exact match in snippet view article find links to article

NP-hard by a reduction from the Steiner tree problem. The reduction takes as input an instance of the Steiner tree problem: a weighted graph, with a subset

Routing (electronic design automation) (1,930 words) [view diff] exact match in snippet view article

known to be intractable. The simplest routing problem, called the Steiner tree problem, of finding the shortest route for one net in one layer with no obstacles

Kalmanson combinatorial conditions (192 words) [view diff] exact match in snippet view article find links to article

MR 0396329. Klinz, Bettina; Woeginger, Gerhard J. (1999), "The Steiner tree problem in Kalmanson matrices and in circulant matrices", Journal of Combinatorial

K-tree (486 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-3-540-85218-6. Hwang, Frank; Richards, Dana; Winter, Pawel (1992), The Steiner Tree Problem, Annals of Discrete Mathematics (North-Holland Mathematics Studies)

Hanan grid (145 words) [view diff] case mismatch in snippet view article find links to article

200-221 Christine R. Leverenz, Miroslaw Truszczynski, The Rectilinear Steiner Tree Problem: Algorithms and Examples using Permutations of the Terminal Set,

Zuse Institute Berlin (453 words) [view diff] case mismatch in snippet view article find links to article

Pseudo-Boolean challenge 2009 Feb 11, 2011. A Generic Approach to Solving the Steiner Tree Problem and Variants Nov 9, 2015. PolySCIP Aug 15, 2016. scipopt May 22,

Petra Mutzel (592 words) [view diff] exact match in snippet view article find links to article

algorithmic framework for the exact solution of the prize-collecting Steiner tree problem", Mathematical Programming, 105 (2–3, Ser. B): 427–449, CiteSeerX 10

Dan Gusfield (1,622 words) [view diff] no match in snippet view article find links to article

computational biology was written in the Yale Technical Report The Steiner-Tree Problem in Phylogeny, which has never been published in a journal. His first

Bipartite graph (4,086 words) [view diff] exact match in snippet view article find links to article

two points have the same parity Quasi-bipartite graph, a type of Steiner tree problem instance in which the terminals form an independent set, allowing

Vertex cover (2,556 words) [view diff] exact match in snippet view article find links to article

2010-03-05. Garey, Michael R.; Johnson, David S. (1977). "The rectilinear Steiner tree problem is NP-complete". SIAM Journal on Applied Mathematics. 32 (4): 826–834