108 search results - page 1 / 22 » Improved bounds and algorithms for graph cuts and network re... |
JNSM
2006
15 years 1 months ago
2006
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
131
click to vote
ECCC
2000
15 years 1 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
112
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
142
click to vote
COMPSAC
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
110
Voted
ICCAD
2006
IEEE
15 years 10 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...