✦ LIBER ✦

Combinatorial algorithms for feedback problems in directed graphs

✍ Scribed by Camil Demetrescu; Irene Finocchi

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 135 KB
Volume: 86
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00491-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Primal-Dual Approximation Algorithms for

Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs

✍ Michel X. Goemans; David P. Williamson 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 289 KB

Non-classical preference models in combi

Non-classical preference models in combinatorial problems: Models and algorithms for graphs

✍ Olivier Spanjaard 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 47 KB

Extremal problems for directed graphs

✍ W.G Brown; P Erdös; M Simonovits 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 858 KB

Metaheuristic algorithms for combinatori

Metaheuristic algorithms for combinatorial optimization problems

✍ Manuel Iori 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 41 KB

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.

Iterative algorithms for generating mini

Iterative algorithms for generating minimal cutsets in directed graphs

✍ D. R. Shier; D. E. Whited 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 803 KB