545 search results - page 50 / 109 » Simultaneous approximation by greedy algorithms |
141
click to vote
FUIN
2006
15 years 4 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
121
click to vote
DKE
2008
15 years 4 months ago
2008
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
144
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
145
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
129
click to vote
SIAMDM
2002
15 years 3 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...