Nimrod Megiddo
Journal of Symbolic Computation
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is fixed. It is demonstrated that in some cases fixing the structure makes the problem easier, whereas in general the problem remains NP-complete.
Nimrod Megiddo
Journal of Symbolic Computation
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Charles Micchelli
Journal of Approximation Theory
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011