Mostrar el registro sencillo del ítem
Artículo
The minimum maximal k-partial-matching problem
dc.creator | García Vargas, Ignacio | es |
dc.creator | Senhadji Navarro, Raouf | es |
dc.date.accessioned | 2019-12-10T11:05:38Z | |
dc.date.available | 2019-12-10T11:05:38Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | García Vargas, I. y Senhadji Navarro, R. (2013). The minimum maximal k-partial-matching problem. Optimization letters, 7 (8), 1959-1968. | |
dc.identifier.issn | 1862-4472 | es |
dc.identifier.uri | https://hdl.handle.net/11441/90799 | |
dc.description.abstract | In this paper, we introduce a new problem related to bipartite graphs called minimum maximal k-partial-matching (MMKPM) which has been modelled by using a relaxation of the concept of matching in a graph. The MMKPM problem can be viewed as a generalization of the classical Hitting Set and Set Cover problems. This property has been used to prove that the MMKPM problem is NPComplete. An integer linear programming formulation and a greedy algorithm have been proposed. The problem can be applied to the design process of finite state machines with input multiplexing for simplifying the complexity of multiplexers. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Springer | es |
dc.relation.ispartof | Optimization letters, 7 (8), 1959-1968. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Bipartite graph | es |
dc.subject | Partial-matching | es |
dc.subject | NP-completeness | es |
dc.subject | Hitting set | es |
dc.subject | Set Cover | es |
dc.subject | Finite state machine | es |
dc.title | The minimum maximal k-partial-matching problem | es |
dc.type | info:eu-repo/semantics/article | es |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores | es |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s11590-012-0531-3 | es |
dc.identifier.doi | 10.1007/s11590-012-0531-3 | es |
idus.format.extent | 10 | es |
dc.journaltitle | Optimization letters | es |
dc.publication.volumen | 7 | es |
dc.publication.issue | 8 | es |
dc.publication.initialPage | 1959 | es |
dc.publication.endPage | 1968 | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
The minimum maximal k-partial- ... | 249.6Kb | [PDF] | Ver/ | |