Author:
Bar-Ilan Judit,Kortsarz Guy,Peleg David
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. A. Bookstein, S.T. Klein, Construction of optimal graphs for bit-vector compression, Proc. 13th ACM SIGIR Conf. 1990, pp. 327–342.
2. Compression of correlated bit-vectors;Bookstein;Inform. Systems,1991
3. How to allocate network centers;Bar-Ilan;J. Algorithms,1993
4. A greedy heuristic for the set-covering problem;Chvatal;Math. Oper. Res.,1979
5. P. Crescenzi, V. Kann, A compendium of NP optimization problems, Technical report, Royal Institute of Technology, Stockholm, Sweden, 1998. http://www.nada.kth.se/ ̃viggo/problemlist/compendium.html.
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding bounded diameter minimum spanning tree in general graphs;Computers & Operations Research;2022-08
2. On Hop-Constrained Steiner Trees in Tree-Like Metrics;SIAM Journal on Discrete Mathematics;2022-06
3. Hop-Constrained Metric Embeddings and their Applications;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. Greedy Approximation and Submodular Optimization;Introduction to Combinatorial Optimization;2022
5. Tree embeddings for hop-constrained network design;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15