Suchergebnisse - "primal-dual approximation algorithm"

A primal-dual approximation algorithm for the Steiner forest problem

Autoren: R. Ravi

Quelle: Information Processing Letters. 50:185-189

Schlagwörter: minimum \(q\)-Steiner forest problem, undirected graph, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, 0211 other engineering and technologies, primal-dual approximation algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/ipl/ipl50.html#Ravi94
http://www.contrib.andrew.cmu.edu/~ravi/R-ipl94.pdf
https://www.sciencedirect.com/science/article/pii/0020019094000344

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

Autoren: Beyer, S. Chimani, M. Spoerhase, J. et al.

Weitere Verfasser: Beyer, S. Chimani, M. Spoerhase, J. et al.

Schlagwörter: Combinatorial mathematics, Graph algorithms, Iterative methods, Approximation factor, Combinatorial algorithm, Connectivity problems, Constant-factor approximation algorithms, Primal dual algorithms, Primal-dual approach, Primal-dual approximation algorithm, Survivable network design, Approximation algorithms

Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); https://osnascholar.ub.uni-osnabrueck.de/handle/unios/18383; 2-s2.0-85091104639; https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091104639&doi=10.1007%2f978-3-030-58150-3_28&partnerID=40&md5=e56d2fc3a590dc9b744088fc33458100

Verfügbarkeit: https://osnascholar.ub.uni-osnabrueck.de/handle/unios/18383
https://doi.org/10.1007/978-3-030-58150-3_28
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091104639&doi=10.1007%2f978-3-030-58150-3_28&partnerID=40&md5=e56d2fc3a590dc9b744088fc33458100