Sciweavers

44651 search results - page 47 / 8931
» Generalized
Sort
View
IPL
2006
101views more  IPL 2006»
13 years 9 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz
JGO
2008
95views more  JGO 2008»
13 years 9 months ago
Generalized Semi-Infinite Programming: on generic local minimizers
Abstract In this paper a basic structural problem in Generalized Semi-Infinite Programming is solved. In fact, under natural and generic assumptions we show that at any (local) min...
Harald Günzel, Hubertus Th. Jongen, Oliver St...
EJC
2007
13 years 9 months ago
On the smallest maximal partial ovoids and spreads of the generalized quadrangles W(q) and Q(4, q)
We present results on the size of the smallest maximal partial ovoids and on the size of the smallest maximal partial spreads of the generalized quadrangles W(q) and Q(4, q). Key ...
M. Cimráková, Stefaan De Winter, Vee...
MST
2008
141views more  MST 2008»
13 years 9 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
ARSCOM
2005
106views more  ARSCOM 2005»
13 years 9 months ago
Chromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Stephen Guattery, Gary Haggard, Ronald C. Read