Sciweavers

Share
19 search results - page 4 / 4
» Convex p-partitions of bipartite graphs
Sort
View
ORL
1998
68views more  ORL 1998»
8 years 11 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
9 years 3 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
ICQNM
2007
IEEE
131views Chemistry» more  ICQNM 2007»
9 years 6 months ago
Comparison of two bounds of the quantum correlation set
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
David Avis, Tsuyoshi Ito
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
9 years 4 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
books