Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
An Approximation Algorithm for Generalized Connectivity Problem on Planar Graphs. |
| Συγγραφείς: |
Sun, Jian1 (AUTHOR) jian_sun@nnu.edu.cn, Wang, Yijing2 (AUTHOR) yjwang@amss.ac.cn |
| Πηγή: |
International Journal of Foundations of Computer Science. Aug2026, Vol. 37 Issue 5, p641-651. 11p. |
| Θεματικοί όροι: |
*Algorithms, Approximation algorithms, Planar graphs, Graph connectivity, Graph theory, Graph algorithms |
| Περίληψη: |
Let G = (V , E) be a graph with nonnegative edge weight function c : E → ℝ + and = { (S 1 , T 1) , (S 2 , T 2) , ... , (S k , T k) } be the set of demands, where S i and T i are distinct vertex subsets for each demand (S i , T i). The objective of generalized connectivity is to find a subgraph F with minimum weight such that for each demand (S i , T i) , there exists a path in F connecting S i and T i . In this paper, we consider the planar generalized connectivity problem, i.e., G is a planar graph, and design a (1 +) O (log 2 k) -approximation algorithm via the junction scheme, along with bucketing-and-scaling technique. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |