论文信息 - Easy Solutions for the K–Center Problem or the Dominating Set Problem on Random Graphs - 字舞流文

Easy Solutions for the K–Center Problem or the Dominating Set Problem on Random Graphs

[1] Rainer E. Burkard,et al. Probabilistic asymptotic properties of some combinatorial optimization problems , 1985, Discret. Appl. Math..

[2] Dorit S. Hochbaum,et al. When are NP-hard location problems easy? , 1984, Ann. Oper. Res..

[3] Rainer E. Burkard,et al. On random quadratic bottleneck assignment problems , 1982, Math. Program..

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .