1 |
A. Brandstadt and R. Mosca, "Maximum Weight Independent Set in Claw-Free Graphs in Polynomial Time", Cornell University, arXiv.org, Data Structures and Algorithms, arXiv:1602.0583, pp. 1-16, Feb. 2016.
|
2 |
G. H. Chen, M. T. Kuo, and J. P. Sheu, "An Optimal Time Algorithm for Finding a Maximum Weight Independent Set in a Tree", BIT Numerical Mathematics, Vol. 28, No. 2, pp. 353-356, Jun. 1988, DOI:https://doi.org/10.1007/ BF01934098
DOI
|
3 |
K. Verhetsel, J. Pellerin, A. Johnen, and J. F. Remacle, "Solving the Maximum Weight Independent Set Problem: Application to Indirect Hex-Mesh Generation", 26th International Meshing Roundtable, pp. 1-69, Sep. 2017.
|
4 |
H. P. Sariel, "CS 473: Fundamental Algorithms, More Dynamic Programming", University of Illinois, Urbana-Champaign, pp. 1-37, Feb. 2011.
|
5 |
K. Erciyes, O. Dagdeviren, D. Cokuslu, O. Yilmaz, and H. Gumus, "Modeling and Simulation of Mobile Ad hoc Networks", Mobile Ad hoc Networks, pp. 134-168, CRC Press, Nov. 2011, DOI:https://doi.org/10.1201/b11447-5
|
6 |
E. Kohler and L. Mouatadid, "A Linear Time Algorithm to Compute a Maximum Weighted Independent Set on Cocomparability Graphs", Information Processing Letters, Vol. 116, No. 6, pp. 391-395, Jun. 2016, DOI:https://doi.org//10. 1016/j.ipl.2015.12.001
DOI
|
7 |
M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-completeness", W. H. Freeman & Co. New York, 1979, ISBN:0716710455
|
8 |
S. U. Lee, "Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem ", Journal of The Korea Society of Computer and Information Vol. 20, No. 1, pp. 111-118, Jan. 2015, DOI:https://doi.org/10.9708/ jksci.2015.20. 1.111
DOI
|
9 |
S. Basagni, "Finding a Maximal Weighted Independent Set in Wireless Networks", Telecommunication Systems, Vol. 18, No. 1-3, pp. 155-168, Sep. 2001, DOI:https://doi.org/10.1023/A: 1016747704458
DOI
|
10 |
C. H. Joo, X. J. Lin, J. Ryu, and N. B. Shroff, "Distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling with Fading Channels", IEEE/ACM Transactions on Networking, Vol. 24, No. 3, pp. 1476-1488, Jun. 2016, DOI:https://doi.org/10.1109/TNET.2015.2417861
DOI
|
11 |
G. Sharma, R. R. Mazumdar, and N. B. Shroff, "On the Complexity of Scheduling in Wireless Networks", Proceedings of the ACM MobiCom '06 12th Annual International Conference on Mobile Computing and Networking, pp. 227-238, Sep. 2006, DOI:https://doi.org/10.1145/1161089. 1161116
|
12 |
M. Hifi, "A Genetic Algorithm-based Heuristic for Solving the Weighted Maximum Independent Set and Some Equivalent Problems", Journal of the Operational Research Society, Vol. 48, No. 6, pp. 612-622, Jun. 1997, DOI:https://doi.org/ 10.1057/palgrave.jors.2600405
DOI
|
13 |
N. Li and L. J. Latecki, "Clustering Aggregation as Maximum-Weight Independent Set", NIPS'12 Proceedings of the 25th International Conference on Neural Information Processing Systems, Vol. 1, pp. 782-790, Dec. 2012.
|
14 |
P. Du and Y. Zhang, "A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem", Mathematical Problems in Engineering, Vol. 2016, Article ID:9790629, pp. 1-10, Hindawi Publishing Co., 2016, DOI:https://doi.org/10.1155/2016/9790629
|
15 |
D. Warrier, W. E. Wilhelm, J. S. Warren, and I. V. Hicks, "A Branch-and-Price Approach for the Maximum Weight Independent Set Problem", Networks, Vol. 46, No. 4, pp. 198-209, Dec. 2005, DOI:https://doi.org/10.1002/net.20088
DOI
|
16 |
J. S. Warren and I. V. Hicks, "Combinatorial Branch-and-Bound for the Maximum Weight Independent Set Problem", Department of Industrial and Systems Engineering, Texas A&M University College Station, pp. 1-23, Aug. 2006.
|
17 |
M. Afif, M. Likas, and V. Paschos, "A Natural Model and a Parallel Algorithm for Approximately Sloving the Maximum Weighted Independent Set Problem", Chaos, Solitons & Fractals, Vol. 5, No. 5, pp. 739-746, May 1995, DOI:https://doi. org/10.1016/0960-0779(94)00175-P
DOI
|
18 |
M. Luby, "A Simple Parallel Algorithm for the Maximal Independent Set Problem", SIAM Journal on Computing, Vol. 15, No. 4, pp. 1036-1053, Nov. 1986, DOI:https://doi.org/10.1145/ 22145.22146
DOI
|
19 |
A. Grzesik, T. Klimosova, M. Pilipczuk, and M. Pilipezuk, "Polynomial-time Algorithm for Maximum Weight Independent Set on-free Graphs", Cornell University, arXiv.org, Data Structures and Algorithms, arXiv:1707.0549, pp. 1-45, Dec. 2017.
|
20 |
Y. D. Liang, S. K. Dhall, and S. Lakshmivarahan, "On the Problem of Finding All Maximum Weight Independent Sets in Interval and Circular-arc Graphs", IEEE Symposium on Applied Computing, pp. 465-470, Apr. 1991, DOI:https://doi.org/10.1109/SOAC.1991.143921
|
21 |
J. M. Keil, D. Pradhan, and M. Vatshelle, "A Polynomial Time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs", Computational Geometry: Theory and Applications, Vol. 60, No. C, pp. 19-25, Jan. 2017, DOI:https://doi.org/10.1016/j.comgeo.2016. 05.001
DOI
|