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 acesso aberto
- Este artigo NÃO é de acesso aberto
-
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: 13 fev. 2026. -
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 2026 fev. 13 ] 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 2026 fev. 13 ] Available from: https://doi.org/10.1006/jagm.1998.0931 - A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Improved approximation algorithms for capacitated fault-tolerant k-center
- Problemas circulatorios em grafos
- Second-price ad auctions with binary bids and markets with good competition
- A better approximation algorithm for finding planar subgraphs
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- Approximating minimum k-section in trees with linear diameter
- Approximation algorithms for the max-buying problem with limited supply
- Trajectory clustering of points in R
- Procedia Computer Science
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
