642 search results - page 49 / 129 » Approximation Algorithms for Minimum K-Cut |
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection needs to b...
137
click to vote
ISPD
1997
ACM
15 years 4 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
100
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...