1568 search results - page 30 / 314 » The problem of examination questions in algorithmics |
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
FPL
2000
Springer
15 years 1 months ago
2000
Springer
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
SODA
2007
ACM
14 years 11 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...