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 do periódico: 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: 18 abr. 2024. -
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 2024 abr. 18 ] 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 2024 abr. 18 ] Available from: https://doi.org/10.1006/jagm.1998.0931 - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- On edge-magic labelings of forests
- Independent dominating sets in planar triangulations
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- 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
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
