466 search results - page 1 / 94 » Algebraic Structures and Algorithms for Matching and Matroid... |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
IPCO
1992
13 years 6 months ago
1992
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
IPCO
2007
13 years 6 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...