A 5/3-approximation for finding spanning trees with many leaves in cubic graphs (2008)
- Autores:
- Autores USP: FERNANDES, CRISTINA GOMES - IME ; WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/978-3-540-77918-6_15
- Assuntos: ALGORITMOS; APROXIMAÇÃO
- Idioma: Inglês
- Imprenta:
- Fonte:
- Título do periódico: Proceedings
- Nome do evento: International Workshop on Approximation and Online Algorithms
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
CORREA, Jose R et al. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-77918-6_15. Acesso em: 23 abr. 2024. -
APA
Correa, J. R., Fernandes, C. G., Matamala, M., & Wakabayashi, Y. (2008). A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-77918-6_15 -
NLM
Correa JR, Fernandes CG, Matamala M, Wakabayashi Y. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs [Internet]. Proceedings. 2008 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/978-3-540-77918-6_15 -
Vancouver
Correa JR, Fernandes CG, Matamala M, Wakabayashi Y. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs [Internet]. Proceedings. 2008 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/978-3-540-77918-6_15 - Approximating a class of combinatorial problems with rational objective function
- Intersection of longest paths in a graph
- Approximating rational objectives is as easy as approximating linear ones
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- Selfish square packing
- Intersecting longest paths
- Prices of anarchy of selfish 2D bin packing games
- Repetition-free longest common subsequence
- Repetition-free longest common subsequence
- A polyhedral investigation of the LCS problem and a repetition-free variant
Informações sobre o DOI: 10.1007/978-3-540-77918-6_15 (Fonte: oaDOI API)
Como citar
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
