4843 search results - page 192 / 969 » The Shortcut Problem - Complexity and Approximation |
132
Voted
SIAMCOMP
2002
15 years 3 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
167
click to vote
SMC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
160
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
101
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
We analyze a simple, Bellman-error-based approach to generating basis functions for valuefunction approximation. We show that it generates orthogonal basis functions that provably...
119
click to vote
ADBIS
2007
Springer
15 years 9 months ago
2007
Springer
Functional dependencies (FDs) are an integral part of database theory since they are used in integrity enforcement and in database design. Recently, functional dependencies satisï¬...