8647 search results - page 410 / 1730 » The Container Selection Problem |
120
click to vote
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
135
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
130
click to vote
CCCG
2003
15 years 6 months ago
2003
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
117
click to vote
COMBINATORICA
2008
15 years 5 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
122
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...