A survey on the densest subgraph problem and its variants
The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …
whose induced subgraph maximizes a measure of density. The problem has received a …
A review on algorithms for maximum clique problems
Q Wu, JK Hao - European Journal of Operational Research, 2015 - Elsevier
The maximum clique problem (MCP) is to determine in a graph a clique (ie, a complete
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …
[图书][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
The Dense k -Subgraph Problem
Algorithmica Page 1 DOI: 10.1007/s004530010050 Algorithmica (2001) 29: 410–421
Algorithmica © 2001 Springer-Verlag New York Inc. The Dense k-Subgraph Problem1 U …
Algorithmica © 2001 Springer-Verlag New York Inc. The Dense k-Subgraph Problem1 U …
[PDF][PDF] Truncated Power Method for Sparse Eigenvalue Problems.
This paper considers the sparse eigenvalue problem, which is to extract dominant (largest)
sparse eigenvectors with at most k non-zero components. We propose a simple yet effective …
sparse eigenvectors with at most k non-zero components. We propose a simple yet effective …
An axiomatic approach for result diversification
S Gollapudi, A Sharma - … of the 18th international conference on World …, 2009 - dl.acm.org
Understanding user intent is key to designing an effective ranking system in a search
engine. In the absence of any explicit knowledge of user intent, search engines want to …
engine. In the absence of any explicit knowledge of user intent, search engines want to …
[图书][B] The geometry of musical rhythm: what makes a" good" rhythm good?
GT Toussaint - 2019 - books.google.com
The original edition of The Geometry of Musical Rhythm was the first book to provide a
systematic and accessible computational geometric analysis of the musical rhythms of the …
systematic and accessible computational geometric analysis of the musical rhythms of the …
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
B Balasundaram, S Butenko… - Operations Research, 2011 - pubsonline.informs.org
This paper introduces and studies the maximum k-plex problem, which arises in social
network analysis and has wider applicability in several important areas employing graph …
network analysis and has wider applicability in several important areas employing graph …
Augmenting scientific creativity with an analogical search engine
Analogies have been central to creative problem-solving throughout the history of science
and technology. As the number of scientific articles continues to increase exponentially …
and technology. As the number of scientific articles continues to increase exponentially …
Approximation accuracy, gradient methods, and error bound for structured convex optimization
P Tseng - Mathematical Programming, 2010 - Springer
Convex optimization problems arising in applications, possibly as approximations of
intractable problems, are often structured and large scale. When the data are noisy, it is of …
intractable problems, are often structured and large scale. When the data are noisy, it is of …