A better approximation algorithm for finding planar subgraphs (1996)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- Assunto: ALGORITMOS PARA PROCESSAMENTO
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: ACM-SIAM Symposium on Discrete Algorithms
-
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e KARLOFF, Howard. A better approximation algorithm for finding planar subgraphs. 1996, Anais.. New York: ACM, 1996. . Acesso em: 25 dez. 2025. -
APA
Calinescu, G., Fernandes, C. G., & Karloff, H. (1996). A better approximation algorithm for finding planar subgraphs. In Proceedings. New York: ACM. -
NLM
Calinescu G, Fernandes CG, Karloff H. A better approximation algorithm for finding planar subgraphs. Proceedings. 1996 ;[citado 2025 dez. 25 ] -
Vancouver
Calinescu G, Fernandes CG, Karloff H. A better approximation algorithm for finding planar subgraphs. Proceedings. 1996 ;[citado 2025 dez. 25 ] - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- Independent dominating sets in planar triangulations
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- On edge-magic labelings of forests
- Questões algorítmicas de natureza combinatória
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Maximum series-parallel subgraph
- Stability in geodesics 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
