Sciweavers

JDA
2008
94views more  JDA 2008»
13 years 11 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
14 years 29 days ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 5 months ago
Partitioning graphs of supply and demand
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
Takehiro Ito, Xiao Zhou, Takao Nishizeki