Results 1  10
of
630,046
Improved Steiner Tree Approximation in Graphs
, 2000
"... The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialtime heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously bestknown approximation ..."
Abstract

Cited by 225 (6 self)
 Add to MetaCart
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialtime heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously best
Strong Steiner Tree Approximations in Practice?
"... Abstract. In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio less than 2. The considered greedy algorithms and approaches based on linear programming involve the incorporation of krestricted full components for some k ≥ 3. For most ..."
Abstract
 Add to MetaCart
Abstract. In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio less than 2. The considered greedy algorithms and approaches based on linear programming involve the incorporation of krestricted full components for some k ≥ 3. For most
The last achievements in Steiner tree approximations
 COMPUTER SCIENCE JOURNAL OF MOLDOVA, VOL.1, NO.1(1)
, 1993
"... The Steiner tree problem requires a shortest tree spanning a given point set S contained in a metric space (V, d). We describe a new approach to approximation solutions of this problem and analyze the time complexity of several algorithms. ..."
Abstract
 Add to MetaCart
The Steiner tree problem requires a shortest tree spanning a given point set S contained in a metric space (V, d). We describe a new approach to approximation solutions of this problem and analyze the time complexity of several algorithms.
Contractionbased Steiner Tree Approximations in Practice
, 2011
"... In this experimental study we consider contractionbased Steiner tree approximations. This class contains the only approximation algorithms that guarantee a constant approximation ratio below 2 and still may be applicable in practice. Despite their vivid evolution in theory, these algorithms have, ..."
Abstract
 Add to MetaCart
In this experimental study we consider contractionbased Steiner tree approximations. This class contains the only approximation algorithms that guarantee a constant approximation ratio below 2 and still may be applicable in practice. Despite their vivid evolution in theory, these algorithms have
Tighter Bounds for Graph Steiner Tree Approximation
 SIAM Journal on Discrete Mathematics
, 2005
"... Abstract. The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialln 3 time heuristic that achieves a bestknown approximation ratio of 1 + ≈ 1.55 for general graphs 2 and best ..."
Abstract

Cited by 85 (6 self)
 Add to MetaCart
Abstract. The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialln 3 time heuristic that achieves a bestknown approximation ratio of 1 + ≈ 1.55 for general graphs 2 and best
Steiner tree approximation via iterative randomized rounding
 Journal of the ACM
"... The Steiner tree problem is one of the most fundamental NPhard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimumcost tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem was improved from 2 to 1.55 [Robins,Zelikovsk ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
The Steiner tree problem is one of the most fundamental NPhard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimumcost tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem was improved from 2 to 1.55 [Robins
Star: Steinertree approximation in relationship graphs
 In ICDE
, 2009
"... Abstract — Large graphs and networks are abundant in modern information systems: entityrelationship graphs over relational data or Webextracted entities, biological networks, social online communities, knowledge bases, and many more. Often such data comes with expressive node and edge labels that ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
an algorithmic point of view, this translates into computing the best Steiner trees between the given nodes, a classical NPhard problem. In this paper, we present a new approximation algorithm, coined STAR, for relationship queries over large relationship graphs. We prove that for n query entities, STAR yields
STAR: Steiner Tree Approximation in RelationshipGraphs
, 2008
"... We would like to thank Gerard de Melo for the thorough proof reading of Largescale graphs and networks are abundant in modern information systems: entityrelationship graphs over relational data or Webextracted entities, biological networks, social online communities, knowledge bases, and many mor ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
block for many search, ranking, and analysis tasks. From an algorithmic point of view, this translates into computing the best Steiner trees between the given nodes, a classical NPhard problem. In this paper, we present a new approximation algorithm, coined STAR, for relationship queries over large
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 822 (39 self)
 Add to MetaCart
vertex cover, maximum satisfiability, maximum cut, metric TSP, Steiner trees and shortest superstring. We also improve upon the clique hardness results of Feige, Goldwasser, Lovász, Safra and Szegedy [42], and Arora and Safra [6] and shows that there exists a positive ɛ such that approximating
Approximating discrete probability distributions with dependence trees
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1968
"... A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n variables ..."
Abstract

Cited by 874 (0 self)
 Add to MetaCart
A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n
Results 1  10
of
630,046