Sciweavers

2976 search results - page 112 / 596
» On the bounded integer programming
Sort
View
94
Voted
DAM
2008
67views more  DAM 2008»
15 years 20 days ago
On the variance of Shannon products of graphs
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
József Balogh, Clifford D. Smyth
103
Voted
ICALP
2003
Springer
15 years 5 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
MP
2011
14 years 7 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi
212
Voted
POPL
2009
ACM
16 years 1 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
112
Voted
DAM
2007
141views more  DAM 2007»
15 years 16 days ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall