Maximum series-parallel subgraph (2010)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-11409-0_5
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Workshop on Graph-Theoretic Concepts in Computer Science - WG
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e KAUL, Hemanshu. Maximum series-parallel subgraph. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-11409-0_5. Acesso em: 04 mar. 2026. -
APA
Calinescu, G., Fernandes, C. G., & Kaul, H. (2010). Maximum series-parallel subgraph. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-11409-0_5 -
NLM
Calinescu G, Fernandes CG, Kaul H. Maximum series-parallel subgraph [Internet]. Proceedings. 2010 ;[citado 2026 mar. 04 ] Available from: https://doi.org/10.1007/978-3-642-11409-0_5 -
Vancouver
Calinescu G, Fernandes CG, Kaul H. Maximum series-parallel subgraph [Internet]. Proceedings. 2010 ;[citado 2026 mar. 04 ] Available from: https://doi.org/10.1007/978-3-642-11409-0_5 - A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Improved approximation algorithms for capacitated fault-tolerant k-center
- Problemas circulatorios em grafos
- Second-price ad auctions with binary bids and markets with good competition
- A better approximation algorithm for finding planar subgraphs
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Approximating minimum k-section in trees with linear diameter
- Approximation algorithms for the max-buying problem with limited supply
- Trajectory clustering of points in R
Informações sobre o DOI: 10.1007/978-3-642-11409-0_5 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
