7930 search results - page 38 / 1586 » Greedy in Approximation Algorithms |
124
click to vote
SIAMCOMP
2002
15 years 2 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
121
click to vote
CAAN
2007
Springer
15 years 8 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
112
click to vote
JACM
2002
15 years 2 months ago
2002
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
The control of quantum phenomena is a topic that has carried out many challenging problems. Among others, the Hamiltonian identification, i.e, the inverse problem associated with ...
119
click to vote
CAINE
2003
15 years 3 months ago
2003
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...