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...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2013 |
| Country: | Argentina |
| Institution: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repository: | CONICET Digital (CONICET) |
| Language: | English |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/79345 |
| Online Access: | http://hdl.handle.net/11336/79345 |
| Access Level: | Open access |
| Keyword: | Edge-Perfect Graph Np-Completeness Totally Balanced Game https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Summary: | 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. |
|---|