4843 search results - page 389 / 969 » The Shortcut Problem - Complexity and Approximation |
119
click to vote
MOC
1998
15 years 4 months ago
1998
Third-order numerical methods are analyzed for secular equations. These equations arise in several matrix problems and numerical linear algebra applications. A closer look at an ex...
114
Voted
NGC
2002
Springer
15 years 4 months ago
2002
Springer
Sequence design is a crucial problem in information-based biotechnology such as DNA-based computation. We introduce a simple strategy named template method that systematically gene...
183
Voted
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
290
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
142
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...