A better approximation ratio for the minimum k-edge-connected spanning subgraph problem (1997)
Source: Proceedings. Conference titles: ACM-SIAM symposium on Discrete algorithms - SODA. Unidade: IME
Subjects: ALGORITMOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem. 1997, Anais.. New York: ACM, 1997. Disponível em: https://dl.acm.org/citation.cfm?id=314161.314402. Acesso em: 09 nov. 2024.APA
Fernandes, C. G. (1997). A better approximation ratio for the minimum k-edge-connected spanning subgraph problem. In Proceedings. New York: ACM. Recuperado de https://dl.acm.org/citation.cfm?id=314161.314402NLM
Fernandes CG. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem [Internet]. Proceedings. 1997 ;[citado 2024 nov. 09 ] Available from: https://dl.acm.org/citation.cfm?id=314161.314402Vancouver
Fernandes CG. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem [Internet]. Proceedings. 1997 ;[citado 2024 nov. 09 ] Available from: https://dl.acm.org/citation.cfm?id=314161.314402
