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: 04 mar. 2026. -
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 2026 mar. 04 ] -
Vancouver
Calinescu G, Fernandes CG, Karloff H. A better approximation algorithm for finding planar subgraphs. Proceedings. 1996 ;[citado 2026 mar. 04 ] - 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
- 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
- Procedia Computer Science
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
