Approximating rational objectives is as easy as approximating linear ones (2006)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/11785293_33
- Subjects: ALGORITMOS; PROGRAMAÇÃO LINEAR; MATEMÁTICA DISCRETA; ALGORITMOS DE APROXIMAÇÃO
- Keywords: rational objective; network design problem; fractional programming
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: Scandinavian Workshop on algorithm theory - SWAT
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
CORREA JÚNIOR, José R. e FERNANDES, Cristina Gomes e WAKABAYASHI, Yoshiko. Approximating rational objectives is as easy as approximating linear ones. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://doi.org/10.1007/11785293_33. Acesso em: 23 abr. 2024. -
APA
Correa Júnior, J. R., Fernandes, C. G., & Wakabayashi, Y. (2006). Approximating rational objectives is as easy as approximating linear ones. In Proceedings. Berlin: Springer. doi:10.1007/11785293_33 -
NLM
Correa Júnior JR, Fernandes CG, Wakabayashi Y. Approximating rational objectives is as easy as approximating linear ones [Internet]. Proceedings. 2006 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/11785293_33 -
Vancouver
Correa Júnior JR, Fernandes CG, Wakabayashi Y. Approximating rational objectives is as easy as approximating linear ones [Internet]. Proceedings. 2006 ;[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/11785293_33 - Approximating a class of combinatorial problems with rational objective function
- Intersection of longest paths in a graph
- 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/11785293_33 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
