626 search results - page 28 / 126 » On Approximability of Minimum Bisection Problem |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
TCS
2008
13 years 8 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
PPL
2000
13 years 8 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...