494 search results - page 36 / 99 » Optimal Carpet Cutting |
WEA
2007
Springer
14 years 2 months ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
CLIMA
2007
13 years 10 months ago
2007
We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...
CCO
2001
Springer
14 years 1 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...