Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/2019
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Çaşkurlu, Buğra | - |
dc.contributor.author | Mkrtchyan, V. | - |
dc.contributor.author | Parekh, O | - |
dc.contributor.author | Subramani, Kiruba Sankaran | - |
dc.date.accessioned | 2019-07-10T14:42:46Z | |
dc.date.available | 2019-07-10T14:42:46Z | |
dc.date.issued | 2014 | |
dc.identifier.citation | Caskurlu, B., Williamson, M., Subramani, K., & Mkrtchyan, V. (2018). On approximating optimal weight “no”-certificates in weighted difference constraint systems. Journal of Combinatorial Optimization, 36(2), 329-345. | en_US |
dc.identifier.issn | 3029743 | |
dc.identifier.uri | https://link.springer.com/chapter/10.1007%2F978-3-662-44602-7_2 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/2019 | - |
dc.description | 8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science | |
dc.description.abstract | Graphs are often used to model risk management in various systems. Particularly, Caskurlu et al. in [6] have considered a system which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level. It can be shown that the main goal in this risk management system can be formulated as a Partial Vertex Coverproblem on bipartite graphs. It is well-known that the vertex cover problem is in P on bipartite graphs; however, the computational complexity of the partial vertex cover problem on bipartite graphs is open. In this paper, we show that the partial vertex cover problem is NP-hard on bipartite graphs. Then, we show that the budgeted maximum coverage problem (a problem related to partial vertex cover problem) admits an 8/9-approximation algorithm in the class of bipartite graphs, which matches the integrality gap of a natural LP relaxation. © 2014 IFIP International Federation for Information Processing. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer Verlag | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Approximation algorithm | en_US |
dc.subject | Algorithms | en_US |
dc.subject | parallel repetition | en_US |
dc.title | On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs | en_US |
dc.type | Conference Object | en_US |
dc.department | Faculties, Faculty of Engineering, Department of Computer Engineering | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | tr_TR |
dc.identifier.volume | 8705 | |
dc.identifier.startpage | 13 | |
dc.identifier.endpage | 26 | |
dc.authorid | 0000-0002-4647-205X | - |
dc.identifier.scopus | 2-s2.0-84906761681 | en_US |
dc.institutionauthor | Çaşkurlu, Buğra | - |
dc.identifier.doi | 10.1007/978-3-662-44602-7_2 | - |
dc.authorscopusid | 35104543000 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q2 | - |
item.openairetype | Conference Object | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.1. Department of Artificial Intelligence Engineering | - |
Appears in Collections: | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
16
checked on Dec 21, 2024
Page view(s)
72
checked on Dec 16, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.