8647 search results - page 508 / 1730 » The Container Selection Problem |
180
Voted
CSR
2009
Springer
16 years 28 days ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
149
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
128
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
154
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
bstraction of Wildlife Footage using Gaussian Mixture Models and the Minimum Description Length Criterion David Gibson Neill Campbell Barry Thomas Department of Computer Science Un...
170
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
Traditionally, when one wants to learn about a particular topic, one reads a book or a survey paper. With the rapid expansion of the Web, learning in-depth knowledge about a topic...