Sciweavers

342 search results - page 14 / 69
» Constrained Integer Partitions
Sort
View
SIAMDM
2008
139views more  SIAMDM 2008»
13 years 8 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
ARSCOM
2005
64views more  ARSCOM 2005»
13 years 8 months ago
Further results for partitions into four squares of equal parity
We prove several results dealing with various counting functions for partitions of an integer into four squares of equal parity. Some are easy consequences of earlier work, but tw...
Michael D. Hirschhorn, James A. Sellers
CAV
2009
Springer
187views Hardware» more  CAV 2009»
14 years 9 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
JAIR
2010
82views more  JAIR 2010»
13 years 7 months ago
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
Gianluigi Greco, Enrico Malizia, Luigi Palopoli, F...
JCDCG
2000
Springer
14 years 1 days ago
Generalized Balanced Partitions of Two Sets of Points in the Plane
We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
Atsushi Kaneko, Mikio Kano