80 search results - page 2 / 16 » Cut problems in graphs with a budget constraint |
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
WG
2000
Springer
13 years 11 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...