메뉴 건너뛰기




Volumn 10, Issue 3, 2016, Pages 477-487

Optimizing top-k retrieval: submodularity analysis and search strategies

Author keywords

diversification; submodular function maximization; top k retrieval

Indexed keywords

APPROXIMATION ALGORITHMS; ITERATIVE METHODS; OPTIMIZATION; QUERY PROCESSING; STAGES;

EID: 84954487454     PISSN: 20952228     EISSN: 20952236     Source Type: Journal    
DOI: 10.1007/s11704-015-5222-7     Document Type: Article
Times cited : (4)

References (25)
  • 13
    • 0000095809 scopus 로고
    • An analysis of approximations for maximizing submodular set functions —I
    • Nemhauser G, Wolsey L, Fisher M. An analysis of approximations for maximizing submodular set functions —I. Mathematical Programming, 1978, 14(1): 265–294
    • (1978) Mathematical Programming , vol.14 , Issue.1 , pp. 265-294
    • Nemhauser, G.1    Wolsey, L.2    Fisher, M.3


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