Sciweavers

867 search results - page 34 / 174
» The Generalized Maximum Coverage Problem
Sort
View
CIKM
2009
Springer
14 years 2 months ago
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
Zhenjiang Lin, Michael R. Lyu, Irwin King
DAM
2006
191views more  DAM 2006»
13 years 8 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
MOR
2000
162views more  MOR 2000»
13 years 8 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
KDD
2006
ACM
118views Data Mining» more  KDD 2006»
14 years 8 months ago
Maximum profit mining and its application in software development
While most software defects (i.e., bugs) are corrected and tested as part of the lengthy software development cycle, enterprise software vendors often have to release software pro...
Charles X. Ling, Victor S. Sheng, Tilmann F. W. Br...
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
14 years 15 days ago
An approximation algorithm for the fault tolerant metric facility location problem
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
Kamal Jain, Vijay V. Vazirani