A new approximation algorithm for finding heavy planar subgraphs (2003)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/s00453-002-1020-3
- Assunto: TEORIA DOS GRAFOS
- Keywords: Weighted planar graph; Approximation algorithm; Performance ratio
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Algorithmica
- ISSN: 0178-4617
- Volume/Número/Paginação/Ano: v. 36, n. 2, p. 179-205, 2003
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
CALINESCU, Gruia; FERNANDES, Cristina Gomes; KARLOFF, Howard; ZELIKOVSKY, Alexander. A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, New York, Springer, v. 36, n. 2, p. 179-205, 2003. Disponível em: < https://doi.org/10.1007/s00453-002-1020-3 > DOI: 10.1007/s00453-002-1020-3. -
APA
Calinescu, G., Fernandes, C. G., Karloff, H., & Zelikovsky, A. (2003). A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, 36( 2), 179-205. doi:10.1007/s00453-002-1020-3 -
NLM
Calinescu G, Fernandes CG, Karloff H, Zelikovsky A. A new approximation algorithm for finding heavy planar subgraphs [Internet]. Algorithmica. 2003 ; 36( 2): 179-205.Available from: https://doi.org/10.1007/s00453-002-1020-3 -
Vancouver
Calinescu G, Fernandes CG, Karloff H, Zelikovsky A. A new approximation algorithm for finding heavy planar subgraphs [Internet]. Algorithmica. 2003 ; 36( 2): 179-205.Available from: https://doi.org/10.1007/s00453-002-1020-3 - Reaction motifs in metabolic networks
- Algoritmos de aproximação e problemas com sequências
- A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- Maximum Series-Parallel Subgraph
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems
- Approximating minimum k-section in trees with linear diameter
- Trajectory clustering of points in R
- Repetition-free longest common subsequence of random sequences
- Approximation algorithms for the Max-Buying problem with limited supply
Informações sobre o DOI: 10.1007/s00453-002-1020-3 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
