A better approximation ratio for the minimum k-edge-connected spanning subgraph problem (1998)
- Autor:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1006/jagm.1998.0931
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Algorithms
- ISSN: 0196-6774
- Volume/Número/Paginação/Ano: v. 28, n. 1, p. 105-124, 1998
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
FERNANDES, Cristina Gomes. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem. Journal of Algorithms, v. 28, n. 1, p. 105-124, 1998Tradução . . Disponível em: https://doi.org/10.1006/jagm.1998.0931. Acesso em: 29 dez. 2025. -
APA
Fernandes, C. G. (1998). A better approximation ratio for the minimum k-edge-connected spanning subgraph problem. Journal of Algorithms, 28( 1), 105-124. doi:10.1006/jagm.1998.0931 -
NLM
Fernandes CG. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem [Internet]. Journal of Algorithms. 1998 ; 28( 1): 105-124.[citado 2025 dez. 29 ] Available from: https://doi.org/10.1006/jagm.1998.0931 -
Vancouver
Fernandes CG. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem [Internet]. Journal of Algorithms. 1998 ; 28( 1): 105-124.[citado 2025 dez. 29 ] Available from: https://doi.org/10.1006/jagm.1998.0931 - Problemas circulatorios em grafos
- A new approximation algorithm for finding heavy planar subgraphs
- Approximation algorithms for the max-buying problem with limited supply
- Geodesic stability for memoryless binary long-lived consensus
- Complexity and approximability of minimum path-collection exact covers
- A concurrent implementation of skip graphs
- Approximation algorithms for the Max-Buying problem with limited supply
- Nonempty intersection of longest paths in series-parallel graphs
- The online multicommodity connected facility location problem
- Reaction motifs in metabolic networks
Informações sobre o DOI: 10.1006/jagm.1998.0931 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
