1068 search results - page 100 / 214 » Factorization as a Rank 1 Problem |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
114
click to vote
SPAA
1999
ACM
15 years 2 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...