Results 1  10
of
912,787
Steiner ShallowLight Trees are Exponentially Lighter than Spanning Ones
"... Abstract — For a pair of parameters α, β ≥ 1, a spanning tree T of a weighted undirected nvertex graph G =(V,E,w) is called an (α, β)shallowlight tree (shortly, (α, β)SLT) of G with respect to a designated vertex rt ∈ V if (1) it approximates all distances from rt to the other vertices up to a f ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract — For a pair of parameters α, β ≥ 1, a spanning tree T of a weighted undirected nvertex graph G =(V,E,w) is called an (α, β)shallowlight tree (shortly, (α, β)SLT) of G with respect to a designated vertex rt ∈ V if (1) it approximates all distances from rt to the other vertices up to a
Approximating BuyatBulk and Shallowlight kSteiner trees
 In Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
, 2006
"... Abstract We study two related network design problems with two cost functions. In the buyatbulk kSteiner tree problem we are given a graph G(V, E) with a set of terminals T ` V including aparticular vertex s called the root, and an integer k < = T . There are two cost functions on theedges o ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
algorithm for the buyatbulk kSteiner tree problem. The second andclosely related one is bicriteria approximation algorithm for Shallowlight kSteiner trees. In theshallowlight kSteiner tree problem we are given a graph G with edge costs b(e) and distance costs r(e), and an integer k. Our goal
Journal of Computational Geometry jocg.org EUCLIDEAN STEINER SHALLOWLIGHT TREES∗
"... Abstract. A spanning tree that simultaneously approximates a shortestpath tree and a minimum spanning tree is called a shallowlight tree (shortly, SLT). More specifically, an (α, β)SLT of a weighted undirected graph G = (V,E,w) with respect to a designated vertex rt ∈ V is a spanning tree of G wi ..."
Abstract
 Add to MetaCart
Abstract. A spanning tree that simultaneously approximates a shortestpath tree and a minimum spanning tree is called a shallowlight tree (shortly, SLT). More specifically, an (α, β)SLT of a weighted undirected graph G = (V,E,w) with respect to a designated vertex rt ∈ V is a spanning tree of G
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
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
Approximate Signal Processing
, 1997
"... It is increasingly important to structure signal processing algorithms and systems to allow for trading off between the accuracy of results and the utilization of resources in their implementation. In any particular context, there are typically a variety of heuristic approaches to managing these tra ..."
Abstract

Cited by 516 (2 self)
 Add to MetaCart
these tradeoffs. One of the objectives of this paper is to suggest that there is the potential for developing a more formal approach, including utilizing current research in Computer Science on Approximate Processing and one of its central concepts, Incremental Refinement. Toward this end, we first summarize a
Results 1  10
of
912,787