| Tài liệu tham khảo |
Loại |
Chi tiết |
| 1. [AKR91] Ajit Agrawal, Philip N. Klein, R. Ravi (1991), “When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks”, STOC 1991, pp. 134-144 |
Sách, tạp chí |
| Tiêu đề: |
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks”, "STOC 1991 |
| Tác giả: |
[AKR91] Ajit Agrawal, Philip N. Klein, R. Ravi |
| Năm: |
1991 |
|
| 2. [Cai93] Mao-cheng Cai (1993), "The number of vertices of degree k in a minimally k-edge-connected graph," J. Combinatorial Theory Series B (58), pp.225-239 |
Sách, tạp chí |
| Tiêu đề: |
The number of vertices of degree k in a minimally k-edge-connected graph |
| Tác giả: |
[Cai93] Mao-cheng Cai |
| Năm: |
1993 |
|
| 3. [CR98] J.Cheriyan, R.Ravi (1998), “Lecture Notes on Approximation Algorithms for Network Problems” |
Sách, tạp chí |
| Tiêu đề: |
Lecture Notes on Approximation Algorithms for Network Problems |
| Tác giả: |
[CR98] J.Cheriyan, R.Ravi |
| Năm: |
1998 |
|
| 4. [CSS01] Joseph Cheriyan, Andras Sebo, Zoltan Szigeti (2001), “Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph”, SIAM J. Discrete Math, 14(2), pp. 170-180 |
Sách, tạp chí |
| Tiêu đề: |
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph”, "SIAM J. Discrete Math |
| Tác giả: |
[CSS01] Joseph Cheriyan, Andras Sebo, Zoltan Szigeti |
| Năm: |
2001 |
|
| 5. [CT00] Joseph Cheriyan, Ramakrishna Thurimella (2000), ”Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching”, SIAM J.Comput, 30(2), pp. 528-560 |
Sách, tạp chí |
| Tiêu đề: |
SIAM J. "Comput |
| Tác giả: |
[CT00] Joseph Cheriyan, Ramakrishna Thurimella |
| Năm: |
2000 |
|
| 6. [CVV01a] Joseph Cheriyan, Santosh Vempala (2001), “Edge Covers of Setpairs and the Iterative Rounding Method”, IPCO 2001, pp. 30-44 |
Sách, tạp chí |
| Tiêu đề: |
Edge Covers of Setpairs and the Iterative Rounding Method”, "IPCO 2001 |
| Tác giả: |
[CVV01a] Joseph Cheriyan, Santosh Vempala |
| Năm: |
2001 |
|
| 8. [CVV02] Joseph Cheriyan, Santosh Vempala, Adrian Vetta (2002), “Approximation algorithms for minimum-cost k-vertex connected subgraphs”, STOC 2002, pp. 306-312 |
Sách, tạp chí |
| Tiêu đề: |
Approximation algorithms for minimum-cost k-vertex connected subgraphs”, "STOC 2002 |
| Tác giả: |
[CVV02] Joseph Cheriyan, Santosh Vempala, Adrian Vetta |
| Năm: |
2002 |
|
| 10. [Fer98] Cristina G. Fernandes (1998), “A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem”, J. Algorithms 28(1), pp. 105-124 |
Sách, tạp chí |
| Tiêu đề: |
A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem”, "J. Algorithms |
| Tác giả: |
[Fer98] Cristina G. Fernandes |
| Năm: |
1998 |
|
| 11. [Fra93] Andras Frank (1993), "Submodular functions in graph theory," Discrete Mathematics (111), pp. 231-243 |
Sách, tạp chí |
| Tiêu đề: |
Submodular functions in graph theory |
| Tác giả: |
[Fra93] Andras Frank |
| Năm: |
1993 |
|
| 12. [FJW01] Lisa Fleischer, Kamal Jain, David P. Williamson (2001). “An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem”, FOCS 2001, pp. 339-347 |
Sách, tạp chí |
| Tiêu đề: |
An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem”, "FOCS 2001 |
| Tác giả: |
[FJW01] Lisa Fleischer, Kamal Jain, David P. Williamson |
| Năm: |
2001 |
|
| 13. [Gab03] Harold N. Gabow (2003), “Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph”, SODA 2003, pp.460-469 |
Sách, tạp chí |
| Tiêu đề: |
Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph”, "SODA 2003 |
| Tác giả: |
[Gab03] Harold N. Gabow |
| Năm: |
2003 |
|
| 14. [Goe01] Michel X. Goemans (2001), “Linear Programming”, 18.415J/6.854J Advanced Algorithms, Fall 2001 |
Sách, tạp chí |
| Tiêu đề: |
Linear Programming |
| Tác giả: |
[Goe01] Michel X. Goemans |
| Năm: |
2001 |
|
| 15. [GGPSTW94] Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Eva Tardos, David P. Williamson (1994), “Improved Approximation Algorithms for Network Design Problems”, SODA 1994, pp.223-232 |
Sách, tạp chí |
| Tiêu đề: |
Improved Approximation Algorithms for Network Design Problems”, "SODA 1994 |
| Tác giả: |
[GGPSTW94] Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Eva Tardos, David P. Williamson |
| Năm: |
1994 |
|
| 16. [GSS93] Naveen Garg, Vempala S. Santosh, Aman Singla (1993), “Improved Approximations for Finding Minimum 2-connected Subgraphs via Better Lower-Bounding Techniques”, SODA 1993, pp. 103-111 |
Sách, tạp chí |
| Tiêu đề: |
Improved Approximations for Finding Minimum 2-connected Subgraphs via Better Lower-Bounding Techniques”, "SODA 1993 |
| Tác giả: |
[GSS93] Naveen Garg, Vempala S. Santosh, Aman Singla |
| Năm: |
1993 |
|
| 17. [GW92] Michel X. Goemans, David P. Williamson (1992), “A General Approximation Technique for Constrained Forest Problems”, SODA 1992, pp.307-316 |
Sách, tạp chí |
| Tiêu đề: |
A General Approximation Technique for Constrained Forest Problems”, "SODA 1992 |
| Tác giả: |
[GW92] Michel X. Goemans, David P. Williamson |
| Năm: |
1992 |
|
| 19. [Jan01] Kamal Jain (2001), “A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem”, Combinatorica 21(1), pp. 39-60 |
Sách, tạp chí |
| Tiêu đề: |
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem”, "Combinatorica |
| Tác giả: |
[Jan01] Kamal Jain |
| Năm: |
2001 |
|
| 21. [JRV03] Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan (2003), “A 5/4-approximation algorithm for minimum 2-edge-connectivity”, SODA 2003, pp. 725-734 |
Sách, tạp chí |
| Tiêu đề: |
A 5/4-approximation algorithm for minimum 2-edge-connectivity”, "SODA 2003 |
| Tác giả: |
[JRV03] Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan |
| Năm: |
2003 |
|
| 22. [KR96] Samir Khuller, Balaji Raghavachari (1996), “Improved Approximation Algorithms for Uniform Connectivity Problems”, J. Algorithms 21(2), pp. 434- 450 |
Sách, tạp chí |
| Tiêu đề: |
Improved Approximation Algorithms for Uniform Connectivity Problems”, "J. Algorithms |
| Tác giả: |
[KR96] Samir Khuller, Balaji Raghavachari |
| Năm: |
1996 |
|
| 23. [KV94] Samir Khuller, Uzi Vishkin (1994), “Biconnectivity approximations and graph carvings”, JACM 41(2), pp. 214-235 |
Sách, tạp chí |
| Tiêu đề: |
Biconnectivity approximations and graph carvings”, "JACM |
| Tác giả: |
[KV94] Samir Khuller, Uzi Vishkin |
| Năm: |
1994 |
|
| 24. [MR02] Thomas L. Magnanti, S. Raghavan (2002), “Strong Formulation for Network Design Problems with Connectivity Requirements” |
Sách, tạp chí |
| Tiêu đề: |
Strong Formulation for Network Design Problems with Connectivity Requirements |
| Tác giả: |
[MR02] Thomas L. Magnanti, S. Raghavan |
| Năm: |
2002 |
|