Sciweavers

2063 search results - page 74 / 413
» connection 2007
Sort
View
ANOR
2007
91views more  ANOR 2007»
14 years 11 months ago
An overview of bilevel optimization
Abstract This paper is devoted to bilevel optimization, a branch of mathematical programming of both practical and theoretical interest. Starting with a simple example, we proceed ...
Benoît Colson, Patrice Marcotte, Gilles Sava...
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
14 years 11 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
APPML
2006
80views more  APPML 2006»
14 years 11 months ago
Unicyclic graphs with exactly two main eigenvalues
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
Yaoping Hou, Feng Tian
APPML
2006
73views more  APPML 2006»
14 years 11 months ago
Threshold arrangements and the knapsack problem
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
Günter Rote, André Schulz
EJC
2006
14 years 11 months ago
Parity reversing involutions on plane trees and 2-Motzkin paths
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
William Y. C. Chen, Louis W. Shapiro, Laura L. M. ...