Optimizing word set coverage for multi-event summarization
type: Item
instance of: scholarly article
title: Optimizing word set coverage for multi-event summarization
zbMATH Open document ID: 1333.90113
author: Jihong Yan
author: Wenliang Cheng
author: Chengyu Wang
author: Jun Liu
author: Ming Gao
author: Aoying Zhou
published in: Journal of Combinatorial Optimization
publication date: 2015-11-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6503887
zbMATH Keywords: event summarization
zbMATH Keywords: word set
zbMATH Keywords: set coverage
zbMATH Keywords: optimization
describes a project that uses: AS 136
MaRDI profile type: Publication
full work available at URL: s10878-015-9855-0
OpenAlex ID: W2112890282
cites work: Surrogate constraint normalization for the set covering problem
cites work: Computational experience with general cutting planes for the set covering problem
cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
cites work: Algorithm AS 136: A K-Means Clustering Algorithm
cites work: 10.1162/jmlr.2003.3.4-5.993
cites work: A Heuristic Method for the Set Covering Problem
cites work: Tight approximation bounds for combinatorial frugal coverage algorithms
cites work: Divergence measures based on the Shannon entropy
cites work: Q3674091
cites work: RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
cites work: A set covering approach for multi-depot train driver scheduling
DOI: 10.1007/S10878-015-9855-0
description: scientific article; zbMATH DE number 6503887