Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1344381,
author = {Adamaszek, Anna and Blin, G. and Popa, Alexandru},
address = {Duluth; United States},
booktitle = {25th International Workshop on Combinatorial Algorithms, IWOCA 2014, LNCS 8986},
doi = {http://dx.doi.org/10.1007/978-3-319-19315-1_2},
keywords = {Algorithms; Bioinformatics; Combinatorial mathematics; Graph theory; Hardness},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Duluth; United States},
isbn = {978-3-319-19314-4},
pages = {13-23},
publisher = {Springer},
title = {Approximation and hardness results for the maximum edges in transitive closure problem},
year = {2015}
}
TY - JOUR
ID - 1344381
AU - Adamaszek, Anna - Blin, G. - Popa, Alexandru
PY - 2015
TI - Approximation and hardness results for the maximum edges in transitive closure problem
PB - Springer
CY - Duluth; United States
SN - 9783319193144
KW - Algorithms
KW - Bioinformatics
KW - Combinatorial mathematics
KW - Graph theory
KW - Hardness
N2 - In this paper we study the following problem, named Maximum Edges in Transitive Closure, which has applications in computational biology. Given a simple, undirected graph G = (V,E) and a coloring of the vertices, remove a collection of edges from the graph such that each connected component is colorful (i.e., it does not contain two identically colored vertices) and the number of edges in the transitive closure of the graph is maximized. The problem is known to be APX-hard, and no approximation algorithms are known for it. We improve the hardness result by showing that the problem is NP-hard to approximate within a factor of |V |1/3-eps, for any constant eps > 0. Additionally, we show that the problem is APXhard already for the case when the number of vertex colors equals 3. We complement these results by showing the first approximation algorithm for the problem, with approximation factor [formula presented]
ER -
ADAMASZEK, Anna, G. BLIN a Alexandru POPA. Approximation and hardness results for the maximum edges in transitive closure problem. In \textit{25th International Workshop on Combinatorial Algorithms, IWOCA 2014, LNCS 8986}. Duluth; United States: Springer, 2015, s.~13-23. ISBN~978-3-319-19314-4. Dostupné z: https://dx.doi.org/10.1007/978-3-319-19315-1\_{}2.
|
