Sciweavers

503 search results - page 27 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
15 years 7 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
WADS
2007
Springer
195views Algorithms» more  WADS 2007»
15 years 9 months ago
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
JUCS
2008
158views more  JUCS 2008»
15 years 3 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
118
Voted
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
15 years 9 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
143
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra