메뉴 건너뛰기




Volumn 2, Issue , 2010, Pages 984-992

Multi-document summarization via the minimum dominating set

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL EXPERIMENTS; MINIMUM DOMINATING SET; MULTI-DOCUMENT SUMMARIZATION;

EID: 80053401617     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (133)

References (31)
  • 2
    • 0000301097 scopus 로고
    • A greedy heuristic for the setcovering problem
    • Chvatal, V. 1979. A greedy heuristic for the setcovering problem. Mathematics of operations research, 4(3):233-235.
    • (1979) Mathematics of Operations Research , vol.4 , Issue.3 , pp. 233-235
    • Chvatal, V.1
  • 6
    • 79952259163 scopus 로고    scopus 로고
    • Lexpagerank: Prestige in multi-document text summarization
    • Erkan, G. and D.R. Radev. 2004. Lexpagerank: Prestige in multi-document text summarization. In Proceedings of EMNLP.
    • (2004) Proceedings of EMNLP
    • Erkan, G.1    Radev, D.R.2
  • 7
    • 0032108328 scopus 로고    scopus 로고
    • A Threshold of ln n for Approximating Set Cover
    • Feige, U. 1998. A threshold of lnn for approximating set cover. Journal of the ACM (JACM), 45(4):634- 652. (Pubitemid 128488790)
    • (1998) Journal of the ACM , vol.45 , Issue.4 , pp. 634-652
    • Feige, U.1
  • 9
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • Guha, S. and S. Khuller. 1998. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374-387. (Pubitemid 128664048)
    • (1998) Algorithmica (New York) , vol.20 , Issue.4 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 10
  • 11
    • 34247518694 scopus 로고    scopus 로고
    • Clustering wireless ad hoc networks with weakly connected dominating set
    • DOI 10.1016/j.jpdc.2007.03.001, PII S0743731507000391
    • Han, B. and W. Jia. 2007. Clustering wireless ad hoc networks with weakly connected dominating set. Journal of Parallel and Distributed Computing, 67(6):727-737. (Pubitemid 46660428)
    • (2007) Journal of Parallel and Distributed Computing , vol.67 , Issue.6 , pp. 727-737
    • Han, B.1    Jia, W.2
  • 12
    • 84942211432 scopus 로고
    • Approximation algorithms for combinatorial problems
    • Johnson, D.S. 1973. Approximation algorithms for combinatorial problems. In Proceedings of STOC.
    • (1973) Proceedings of STOC
    • Johnson, D.S.1
  • 14
    • 0004116427 scopus 로고
    • PhD thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm
    • Kann, V. 1992. On the approximability of NP complete optimization problems. PhD thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm.
    • (1992) On the Approximability of NP Complete Optimization Problems
    • Kann, V.1
  • 16
    • 85016508365 scopus 로고    scopus 로고
    • Automatic evaluation of summaries using n-gram co-occurrence statistics
    • Lin, C.Y. and E. Hovy. 2003. Automatic evaluation of summaries using n-gram co-occurrence statistics. In Proceedings of HLT-NAACL.
    • (2003) Proceedings of HLT-NAACL
    • Lin, C.Y.1    Hovy, E.2
  • 17
  • 18
    • 80053378814 scopus 로고    scopus 로고
    • Topic-driven multi-document summarization with encyclopedic knowledge and spreading activation
    • Nastase, V. 2008. Topic-driven multi-document summarization with encyclopedic knowledge and spreading activation. In Proceedings of EMNLP.
    • (2008) Proceedings of EMNLP
    • Nastase, V.1
  • 21
    • 0030714232 scopus 로고    scopus 로고
    • A sub-constant errorprobability low-degree test, and a sub-constant error-probability PCP characterization of NP
    • Raz, R. and S. Safra. 1997. A sub-constant errorprobability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of STOC.
    • (1997) Proceedings of STOC
    • Raz, R.1    Safra, S.2
  • 23
    • 80052026658 scopus 로고    scopus 로고
    • Multi-topic based query-oriented summarization
    • Tang, J., L. Yao, and D. Chen. 2009. Multi-topic based Query-oriented Summarization. In Proceedings of SDM.
    • (2009) Proceedings of SDM
    • Tang, J.1    Yao, L.2    Chen, D.3
  • 24
    • 34548693199 scopus 로고    scopus 로고
    • On approximation algorithms of k-connected m-dominating sets in disk graphs
    • DOI 10.1016/j.tcs.2007.05.025, PII S0304397507004549
    • Thai, M.T., N. Zhang, R. Tiwari, and X. Xu. 2007. On approximation algorithms of k-connected mdominating sets in disk graphs. Theoretical Computer Science, 385(1-3):49-59. (Pubitemid 47419155)
    • (2007) Theoretical Computer Science , vol.385 , Issue.1-3 , pp. 49-59
    • Thai, M.T.1    Zhang, N.2    Tiwari, R.3    Xu, X.4
  • 25
    • 84880859657 scopus 로고    scopus 로고
    • Manifoldranking based topic-focused multi-document summarization
    • Wan, X., J. Yang, and J. Xiao. 2007a. Manifoldranking based topic-focused multi-document summarization. In Proceedings of IJCAI.
    • (2007) Proceedings of IJCAI
    • Wan, X.1    Yang, J.2    Xiao, J.3
  • 26
    • 84856803164 scopus 로고    scopus 로고
    • Towards an iterative reinforcement approach for simultaneous document summarization and keyword extraction
    • Wan, X., J. Yang, and J. Xiao. 2007b. Towards an iterative reinforcement approach for simultaneous document summarization and keyword extraction. In Proceedings of ACL.
    • (2007) Proceedings of ACL
    • Wan, X.1    Yang, J.2    Xiao, J.3
  • 27
    • 57349111750 scopus 로고    scopus 로고
    • Multidocument summarization via sentence-level semantic analysis and symmetric matrix factorization
    • Wang, D., T. Li, S. Zhu, and C. Ding. 2008. Multidocument summarization via sentence-level semantic analysis and symmetric matrix factorization. In Proceedings of SIGIR.
    • (2008) Proceedings of SIGIR
    • Wang, D.1    Li, T.2    Zhu, S.3    Ding, C.4
  • 28
    • 74549224506 scopus 로고    scopus 로고
    • Comparative document summarization via discriminative sentence selection
    • Wang, D., S. Zhu, T. Li, and Y. Gong. 2009a. Comparative document summarization via discriminative sentence selection. In Proceeding of CIKM.
    • (2009) Proceeding of CIKM
    • Wang, D.1    Zhu, S.2    Li, T.3    Gong, Y.4
  • 30
    • 57349156610 scopus 로고    scopus 로고
    • Querysensitive mutual reinforcement chain and its application in query-oriented multi-document summarization
    • Wei, F., W. Li, Q. Lu, and Y. He. 2008. Querysensitive mutual reinforcement chain and its application in query-oriented multi-document summarization. In Proceedings of SIGIR.
    • (2008) Proceedings of SIGIR
    • Wei, F.1    Li, W.2    Lu, Q.3    He, Y.4
  • 31
    • 23044531399 scopus 로고    scopus 로고
    • A dominating-set-based routing scheme in ad hoc wireless networks
    • Wu, J. and H. Li. 2001. A dominating-set-based routing scheme in ad hoc wireless networks. Telecommunication Systems, 18(1):13-36.
    • (2001) Telecommunication Systems , vol.18 , Issue.1 , pp. 13-36
    • Wu, J.1    Li, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.