✦ LIBER ✦

Greedy approximation algorithms for directed multicuts

✍ Scribed by Yana Kortsarts; Guy Kortsarz; Zeev Nutov

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 100 KB
Volume: 45
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20066

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Steiner and

Approximation Algorithms for Steiner and Directed Multicuts

✍ Philip N Klein; Serge A Plotkin; Satish Rao; Éva Tardos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 277 KB

In this paper we consider the Steiner multicut problem. This is a generalization of the minimum multicut problem where instead of separating node pairs, the goal is to find a minimum weight set of edges that separates all given sets of nodes. A set is considered separated if it is not contained in a

Approximation Algorithms for Directed St

Approximation Algorithms for Directed Steiner Problems

✍ Moses Charikar; Chandra Chekuri; To-yat Cheung; Zuo Dai; Ashish Goel; Sudipto Gu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing.

Lower bounds for the relative greedy alg

Lower bounds for the relative greedy algorithm for approximating Steiner trees

✍ Stefan Hougardy; Stefan Kirchner 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

Greedy Algorithms andM-Term Approximatio

Greedy Algorithms andM-Term Approximation with Regard to Redundant Dictionaries

✍ V.N. Temlyakov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 198 KB

We study the efficiency of greedy type algorithms with regard to redundant dictionaries in Hilbert space and we prove a general result which gives a sufficient condition on a dictionary to guarantee that the pure greedy algorithm is near best in the sense of power decay of error of approximation. We

Direct algorithm for the random-phase ap

Direct algorithm for the random-phase approximation

✍ V. G. Zakrzewski; O. Dolgounitcheva; J. V. Ortiz 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 525 KB

An algorithm for calculating excitation energies and transition moments in the randomphase approximation (RPA) of the polarization propagator is presented. The algorithm includes direct solution of the RPA eigenvalue problem and direct evaluation of products of superoperator Hamiltonian matrices wit

Greedy Algorithm for General Biorthogona

Greedy Algorithm for General Biorthogonal Systems

✍ P. Wojtaszczyk 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 189 KB

We consider biorthogonal systems in quasi-Banach spaces such that the greedy algorithm converges for each x # X (quasi-greedy systems). We construct quasigreedy conditional bases in a wide range of Banach spaces. We also compare the greedy algorithm for the multidimensional Haar system with the opti