Sciweavers

86 search results - page 9 / 18
» Combinatorics of generalized q-Euler numbers
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 1 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
13 years 7 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
COCOON
2007
Springer
14 years 1 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolutionary algorithms and matroid optimization problems
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...
Joachim Reichel, Martin Skutella
SIAMMAX
2010
123views more  SIAMMAX 2010»
13 years 2 months ago
Joint Spectral Characteristics of Matrices: A Conic Programming Approach
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
Vladimir Protasov, Raphaël M. Jungers, Vincen...