On the complexity of solving or approximating convex recoloring problems (2013)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-38768-5_54
- Subjects: TEORIA DOS GRAFOS; ALGORITMOS DE APROXIMAÇÃO
- Keywords: Convex recoloring; NP-hardness; inapproximability; polynomial algorithm; grid graph; cograph
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Computing and Combinatorics Conference - COCOON
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
CAMPÊLO, Manoel B et al. On the complexity of solving or approximating convex recoloring problems. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://doi.org/10.1007/978-3-642-38768-5_54. Acesso em: 28 jan. 2026. -
APA
Campêlo, M. B., Huiban, C. G., Sampaio, R. M., & Wakabayashi, Y. (2013). On the complexity of solving or approximating convex recoloring problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-38768-5_54 -
NLM
Campêlo MB, Huiban CG, Sampaio RM, Wakabayashi Y. On the complexity of solving or approximating convex recoloring problems [Internet]. Proceedings. 2013 ;[citado 2026 jan. 28 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54 -
Vancouver
Campêlo MB, Huiban CG, Sampaio RM, Wakabayashi Y. On the complexity of solving or approximating convex recoloring problems [Internet]. Proceedings. 2013 ;[citado 2026 jan. 28 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54 - On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets
- Polyhedral and computational results on the k-hop connected dominating set problem
- Polynomial-time approximation schemes for circle packing problems
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Some approximation results for the maximum agreement forest problem
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Approximation results on balanced connected partitions of graphs
Informações sobre o DOI: 10.1007/978-3-642-38768-5_54 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3035047.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
