350 search results - page 37 / 70 » Lower bounds and heuristic algorithms for the k |
GD
2003
Springer
14 years 1 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
SIAMSC
2008
13 years 8 months ago
2008
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...
IPPS
1999
IEEE
14 years 24 days ago
1999
IEEE
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...