178 search results - page 30 / 36 » Computing Longest Previous Factor in linear time and applica... |
91
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
111
Voted
BPM
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
119
Voted
DM
2006
15 years 12 days ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
108
Voted
STOC
2003
ACM
16 years 20 days ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
104
click to vote
CORR
2007
Springer
15 years 10 days ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...