A better approximation ratio for the minimum k-edge-connected spanning subgraph problem (1997)
- Autor:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- Subjects: ALGORITMOS; TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: ACM-SIAM symposium on Discrete algorithms - SODA
-
ABNT
FERNANDES, Cristina Gomes. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem. 1997, Anais.. New York: ACM, 1997. Disponível em: https://dl.acm.org/citation.cfm?id=314161.314402. Acesso em: 26 abr. 2024. -
APA
Fernandes, C. G. (1997). A better approximation ratio for the minimum k-edge-connected spanning subgraph problem. In Proceedings. New York: ACM. Recuperado de https://dl.acm.org/citation.cfm?id=314161.314402 -
NLM
Fernandes CG. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem [Internet]. Proceedings. 1997 ;[citado 2024 abr. 26 ] Available from: https://dl.acm.org/citation.cfm?id=314161.314402 -
Vancouver
Fernandes CG. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem [Internet]. Proceedings. 1997 ;[citado 2024 abr. 26 ] Available from: https://dl.acm.org/citation.cfm?id=314161.314402 - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Independent dominating sets in planar triangulations
- On edge-magic labelings of forests
- Problemas circulatorios em grafos
- A new approximation algorithm for finding heavy planar subgraphs
- Approximation algorithms for the max-buying problem with limited supply
- Geodesic stability for memoryless binary long-lived consensus
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas