A better approximation algorithm for finding planar subgraphs (1998)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1006/jagm.1997.0920
- Subjects: TEORIA DOS GRAFOS; ALGORITMOS GRÁFICOS
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Algorithms
- ISSN: 0196-6774
- Volume/Número/Paginação/Ano: v. 27, n. 2, p. 269-302, 1998
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
CALINESCU, Gruia et al. A better approximation algorithm for finding planar subgraphs. Journal of Algorithms, v. 27, n. 2, p. 269-302, 1998Tradução . . Disponível em: https://doi.org/10.1006/jagm.1997.0920. Acesso em: 05 jan. 2026. -
APA
Calinescu, G., Fernandes, C. G., Finkler, U., & Karloff, H. (1998). A better approximation algorithm for finding planar subgraphs. Journal of Algorithms, 27( 2), 269-302. doi:10.1006/jagm.1997.0920 -
NLM
Calinescu G, Fernandes CG, Finkler U, Karloff H. A better approximation algorithm for finding planar subgraphs [Internet]. Journal of Algorithms. 1998 ; 27( 2): 269-302.[citado 2026 jan. 05 ] Available from: https://doi.org/10.1006/jagm.1997.0920 -
Vancouver
Calinescu G, Fernandes CG, Finkler U, Karloff H. A better approximation algorithm for finding planar subgraphs [Internet]. Journal of Algorithms. 1998 ; 27( 2): 269-302.[citado 2026 jan. 05 ] Available from: https://doi.org/10.1006/jagm.1997.0920 - Problemas circulatorios em grafos
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- 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
- 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
- A concurrent implementation of skip graphs
- Complexity and approximability of minimum path-collection exact covers
Informações sobre o DOI: 10.1006/jagm.1997.0920 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
