534 search results - page 39 / 107 » Tight approximation algorithm for connectivity augmentation ... |
147
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
168
Voted
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
128
Voted
IJWIN
2006
15 years 2 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
113
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
162
Voted
ARITH
2011
IEEE
14 years 2 months ago
2011
IEEE
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...