2477 search results - page 153 / 496 » Approximate extended formulations |
150
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
148
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We generalize the concept of multiuser peer-to-peer (MUP2P) relay networks to that of a multi-group multicasting (MGM) relay network where each source may broadcast its message to...
127
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
132
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
170
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...