4131 search results - page 62 / 827 » The Generalized Max-Controlled Set Problem |
167
click to vote
HEURISTICS
2010
14 years 9 months ago
2010
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
132
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
144
click to vote
CHI
2011
ACM
14 years 6 months ago
2011
ACM
Understanding how people interact with search engines is important in improving search quality. Web search engines typically analyze queries and clicked results, but these actions...
105
click to vote
MP
2006
15 years 2 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
119
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...