Cut problems in graphs with a budget constraint
نویسندگان
چکیده
منابع مشابه
Cut Problems in Graphs with a Budget Constraint
We study budgeted variants of classical cut problems: the Multiway Cut problem, the Multicut problem, and the k-Cut problem, and provide approximation algorithms for these problems. Specifically, for the budgeted multiway cut and the k-cut problems we provide constant factor approximation algorithms. We show that the budgeted multicut problem is at least as hard to approximate as the sparsest c...
متن کاملPrize-Collecting TSP with a Budget Constraint
We consider constrained versions of the prize-collecting traveling salesman and the minimum spanning tree problems. The goal is to maximize the number of vertices in the returned tour/tree subject to a bound on the tour/tree cost. We present a 2-approximation algorithm for these problems based on a primal-dual approach. The algorithm relies on finding a threshold value for the dual variable cor...
متن کاملOntology Constraint Satisfaction Problems using Conceptual Graphs
In this paper we present a visual formalism for representing constraints over knowledge intensive domains. Our approach is based on Conceptual Graphs and consequently benefits from their visual and semantic properties. By expressing constraint satisfaction problems using conceptual graphs we can use effective hybrid strategies to solve them. Central to this approach is the possibility of using ...
متن کاملSparse Constraint Graphs and Exceptionally Hard Problems
Many types of problem exhibit a phase transition as a problem parameter is varied, from a region where most problems are easy and soluble to a region where most problems are easy but insoluble. In the intervening phase transition region, the median problem di culty is greatest. However, occasional exceptionally hard problems (ehps) can be found in the easy and soluble region: these problems can...
متن کاملEnumerating Cut Conjunctions in Graphs and Related Problems
LetG = (V,E) be an undirected graph, and letB ⊆ V ×V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ⊆ E such that every vertex pair (s, t) ∈ B is disconnected in (V,ErX), generalizing well-known efficient algorithms for enumerating all minimal s-t cuts, for a given pair s, t ∈ V of vertices. We also present an incremental p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2007
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.05.002