626 search results - page 63 / 126 » On Approximability of Minimum Bisection Problem |
110
click to vote
PG
2007
IEEE
15 years 4 months ago
2007
IEEE
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
SIAMDM
2000
14 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
LCN
2005
IEEE
15 years 3 months ago
2005
IEEE
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
103
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
STOC
1998
ACM
15 years 2 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...