Obnoxious facility location on graphs
SIAM Journal on Discrete Mathematics
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
Greedily Finding a Dense Subgraph
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Facility Dispersion and Remote Subgraphs
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Journal of Computer and System Sciences
Computational aspects of the maximum diversity problem
Operations Research Letters
Approximating the maximum quadratic assignment problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Complexity of finding dense subgraphs
Discrete Applied Mathematics
Robust Matchings and Maximum Clustering
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Generalized Maximum Independent Sets for Trees in Subquadratic Time
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Maximum dispersion and geometric maximum weight cliques
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
Robust subgraphs for trees and paths
ACM Transactions on Algorithms (TALG)
Extracting redundancy-aware top-k patterns
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Information Processing Letters
Convergent SparseDT topology control protocol in dense sensor networks
Proceedings of the 2nd international conference on Scalable information systems
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
Information Processing Letters
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
An axiomatic approach for result diversification
Proceedings of the 18th international conference on World wide web
Computational geometric aspects of rhythm, melody, and voice-leading
Computational Geometry: Theory and Applications
Competitive Hopfield network combined with estimation of distribution for maximum diversity problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
Information Processing Letters
ACM SIGMOD Record
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Computational Geometry: Theory and Applications
Consideration set generation in commerce search
Proceedings of the 20th international conference on World wide web
Diversifying search results of controversial queries
Proceedings of the 20th ACM international conference on Information and knowledge management
The geometry of musical rhythm
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Min sum clustering with penalties
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximation algorithms for spreading points
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Pairwise local alignment of protein interaction networks guided by models of evolution
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Maximum dispersion problem in dense graphs
Operations Research Letters
Approximation algorithms for the metric maximum clustering problem with given cluster sizes
Operations Research Letters
Diversifying user comments on news articles
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
A linear time approximation scheme for computing geometric maximum k-star
Journal of Global Optimization
Diversity maximization under matroid constraints
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Diversified top-k graph pattern matching
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We describe approximation algorithms with bounded performance guarantees for the following problem: A graph is given with edge weights satisfying the triangle inequality, together with two numbers k and p. Find k disjoint subsets of p vertices each, so that the total weight of edges within subsets is maximized