Sciweavers

61 search results - page 7 / 13
» cocoon 2005
Sort
View
COCOON
2005
Springer
14 years 1 months ago
Complexity and Approximation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
COCOON
2005
Springer
14 years 1 months ago
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu
COCOON
2005
Springer
13 years 9 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
COCOON
2005
Springer
14 years 1 months ago
Error-Set Codes and Related Objects
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
An Braeken, Ventzislav Nikov, Svetla Nikova
COCOON
2005
Springer
14 years 1 months ago
Improved Algorithms for the K-Maximum Subarray Problem for Small K
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
Sung Eun Bae, Tadao Takaoka