Results 1  10
of
598,479
A polylogarithmic approximation algorithm for the group Steiner tree problem
 Journal of Algorithms
, 2000
"... The group Steiner tree problem is a generalization of the Steiner tree problem where we ae given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimumweight connected subgraph containing at least one vertex from each group. The problem was introduced by Reich a ..."
Abstract

Cited by 150 (9 self)
 Add to MetaCart
The group Steiner tree problem is a generalization of the Steiner tree problem where we ae given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimumweight connected subgraph containing at least one vertex from each group. The problem was introduced by Reich
Advanced Approximation Algorithms (CMU 15854B, Spring 2008) Lecture 10: Group Steiner Tree problem
, 2008
"... We will be studying the Group Steiner tree problem in this lecture. Recall that the classical Steiner tree problem is the following. Given a weighted graph G = (V, E), a subset S ⊆ V of the vertices, and a root r ∈ V, we want to find a minimum weight tree which connects all the vertices in S to r. T ..."
Abstract
 Add to MetaCart
We will be studying the Group Steiner tree problem in this lecture. Recall that the classical Steiner tree problem is the following. Given a weighted graph G = (V, E), a subset S ⊆ V of the vertices, and a root r ∈ V, we want to find a minimum weight tree which connects all the vertices in S to r
15854: Approximations Algorithms Lecturer: R. Ravi Topic: Randomized Rounding: Group Steiner Tree Date: 11/9/05
"... In this lecture, we show how to use the Randomized Rounding to devise a polylogarithmic approximation algorithm for the group Steiner tree problem. Given a weighted undirected graph with some subsets of vertices called groups, the group Steiner tree problem is defined as finding a ..."
Abstract
 Add to MetaCart
In this lecture, we show how to use the Randomized Rounding to devise a polylogarithmic approximation algorithm for the group Steiner tree problem. Given a weighted undirected graph with some subsets of vertices called groups, the group Steiner tree problem is defined as finding a
The ubiquitous Btree
 ACM Computing Surveys
, 1979
"... Btrees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and generalpurpose access methods have all been proposed and nnplemented using Btrees This paper reviews Btrees and shows why they have been so successful It discusses the major var ..."
Abstract

Cited by 653 (0 self)
 Add to MetaCart
Btrees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and generalpurpose access methods have all been proposed and nnplemented using Btrees This paper reviews Btrees and shows why they have been so successful It discusses the major
Induction of Decision Trees
 MACH. LEARN
, 1986
"... The technology for building knowledgebased systems by inductive inference from examples has been demonstrated successfully in several practical applications. This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such syste ..."
Abstract

Cited by 4303 (4 self)
 Add to MetaCart
The technology for building knowledgebased systems by inductive inference from examples has been demonstrated successfully in several practical applications. This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one
Rectilinear Group Steiner Trees and Applications in VLSI Design
, 2000
"... Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of finding a shortest interconnection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the wellknown rectiline ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of finding a shortest interconnection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the well
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
Scalable Recognition with a Vocabulary Tree
 IN CVPR
, 2006
"... A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CDcovers from a database of 40000 images of popular music CD's. The scheme ..."
Abstract

Cited by 1043 (0 self)
 Add to MetaCart
A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CDcovers from a database of 40000 images of popular music CD's. The scheme
On the Construction of EnergyEfficient Broadcast and Multicast Trees in Wireless Networks
, 2000
"... wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil ..."
Abstract

Cited by 554 (13 self)
 Add to MetaCart
wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil
ZTree: Zurich Toolbox for Readymade Economic Experiments, Working paper No
, 1999
"... 2.2.2 Startup of the Experimenter PC............................................................................................... 9 2.2.3 Startup of the Subject PCs....................................................................................................... 9 ..."
Abstract

Cited by 1956 (33 self)
 Add to MetaCart
2.2.2 Startup of the Experimenter PC............................................................................................... 9 2.2.3 Startup of the Subject PCs....................................................................................................... 9
Results 1  10
of
598,479