Approximating a class of combinatorial problems with rational objective function (2010)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/s10107-010-0364-8
- Assunto: OTIMIZAÇÃO COMBINATÓRIA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Mathematical Programming
- ISSN: 0025-5610
- Volume/Número/Paginação/Ano: v. 124, n. 1-2, p. 255-269, 2010
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
CORREA, J. R. e FERNANDES, Cristina Gomes e WAKABAYASHI, Yoshiko. Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, v. 124, n. 1-2, p. 255-269, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10107-010-0364-8. Acesso em: 24 abr. 2024. -
APA
Correa, J. R., Fernandes, C. G., & Wakabayashi, Y. (2010). Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, 124( 1-2), 255-269. doi:10.1007/s10107-010-0364-8 -
NLM
Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2024 abr. 24 ] Available from: https://doi.org/10.1007/s10107-010-0364-8 -
Vancouver
Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2024 abr. 24 ] Available from: https://doi.org/10.1007/s10107-010-0364-8 - Intersection of longest paths in a graph
- Approximating rational objectives is as easy as approximating linear ones
- A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
- 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
- A polyhedral investigation of the LCS problem and a repetition-free variant
- Repetition-free longest common subsequence
- Repetition-free longest common subsequence
Informações sobre o DOI: 10.1007/s10107-010-0364-8 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
