604 search results - page 27 / 121 » On the Complexity of the Maximum Cut Problem |
3DPVT
2004
IEEE
14 years 1 months ago
2004
IEEE
In this paper, we present an approach based on 2D slices for measuring similarity between 3D models. The key idea is to represent the 3D model by a series of slices along certain ...
COCOON
2003
Springer
14 years 3 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
DSN
2002
IEEE
14 years 2 months ago
2002
IEEE
This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sen...
WINE
2009
Springer
14 years 4 months ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...