A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the polynomiality for the covering case. In addition, we solve the computational com...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2013 |
| País: | Argentina |
| Recursos: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositório: | CONICET Digital (CONICET) |
| Idioma: | inglês |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/79345 |
| Acesso em linha: | http://hdl.handle.net/11336/79345 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Edge-Perfect Graph Np-Completeness Totally Balanced Game https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Resumo: | We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the polynomiality for the covering case. In addition, we solve the computational complexity of universally balanced (with respect to the resources constraints) packing games. |
|---|