24,850 research outputs found
A Variant of the Maximum Weight Independent Set Problem
We study a natural extension of the Maximum Weight Independent Set Problem
(MWIS), one of the most studied optimization problems in Graph algorithms. We
are given a graph , a weight function ,
a budget function , and a positive integer .
The weight (resp. budget) of a subset of vertices is the sum of weights (resp.
budgets) of the vertices in the subset. A -budgeted independent set in
is a subset of vertices, such that no pair of vertices in that subset are
adjacent, and the budget of the subset is at most . The goal is to find a
-budgeted independent set in such that its weight is maximum among all
the -budgeted independent sets in . We refer to this problem as MWBIS.
Being a generalization of MWIS, MWBIS also has several applications in
Scheduling, Wireless networks and so on. Due to the hardness results implied
from MWIS, we study the MWBIS problem in several special classes of graphs. We
design exact algorithms for trees, forests, cycle graphs, and interval graphs.
In unweighted case we design an approximation algorithm for -claw free
graphs whose approximation ratio () is competitive with the approximation
ratio () of MWIS (unweighted). Furthermore, we extend Baker's
technique \cite{Baker83} to get a PTAS for MWBIS in planar graphs.Comment: 18 page
Approximating Properties of Data Streams
In this dissertation, we present algorithms that approximate properties in the data stream model, where elements of an underlying data set arrive sequentially, but algorithms must use space sublinear in the size of the underlying data set. We first study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said to have k-period p if its prefix of length n − p differs from its suffix of length n − p in at most k locations. We give algorithms to compute the k-periods of a string S using poly(k, log n) bits of space and we complement these results with comparable lower bounds. We then study the problem of identifying a longest substring of strings S and T of length n that forms a d-near-alignment under the edit distance, in the simultaneous streaming model. In this model, symbols of strings S and T are streamed at the same time and form a d-near-alignment if the distance between them in some given metric is at most d. We give several algorithms, including an exact one-pass algorithm that uses O(d2 + d log n) bits of space. We then consider the distinct elements and `p-heavy hitters problems in the sliding window model, where only the most recent n elements in the data stream form the underlying set. We first introduce the composable histogram, a simple twist on the exponential (Datar et al., SODA 2002) and smooth histograms (Braverman and Ostrovsky, FOCS 2007) that may be of independent interest. We then show that the composable histogram along with a careful combination of existing techniques to track either the identity or frequency of a few specific items suffices to obtain algorithms for both distinct elements and `p-heavy hitters that is nearly optimal in both n and c. Finally, we consider the problem of estimating the maximum weighted matching of a graph whose edges are revealed in a streaming fashion. We develop a reduction from the maximum weighted matching problem to the maximum cardinality matching problem that only doubles the approximation factor of a streaming algorithm developed for the maximum cardinality matching problem. As an application, we obtain an estimator for the weight of a maximum weighted matching in bounded-arboricity graphs and in particular, a (48 + )-approximation estimator for the weight of a maximum weighted matching in planar graphs
Interdiction Problems on Planar Graphs
Interdiction problems are leader-follower games in which the leader is
allowed to delete a certain number of edges from the graph in order to
maximally impede the follower, who is trying to solve an optimization problem
on the impeded graph. We introduce approximation algorithms and strong
NP-completeness results for interdiction problems on planar graphs. We give a
multiplicative -approximation for the maximum matching
interdiction problem on weighted planar graphs. The algorithm runs in
pseudo-polynomial time for each fixed . We also show that
weighted maximum matching interdiction, budget-constrained flow improvement,
directed shortest path interdiction, and minimum perfect matching interdiction
are strongly NP-complete on planar graphs. To our knowledge, our
budget-constrained flow improvement result is the first planar NP-completeness
proof that uses a one-vertex crossing gadget.Comment: 25 pages, 9 figures. Extended abstract in APPROX-RANDOM 201
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
We study the family of intersection graphs of low density objects in low
dimensional Euclidean space. This family is quite general, and includes planar
graphs. We prove that such graphs have small separators. Next, we present
efficient -approximation algorithms for these graphs, for
Independent Set, Set Cover, and Dominating Set problems, among others. We also
prove corresponding hardness of approximation for some of these optimization
problems, providing a characterization of their intractability in terms of
density
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
We develop a framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world networks) while still guaranteeing approximation ratios. The idea is to edit a given graph via vertex- or edge-deletions to put the graph into an algorithmically tractable class, apply known approximation algorithms for that class, and then lift the solution to apply to the original graph. We give a general characterization of when an optimization problem is amenable to this approach, and show that it includes many well-studied graph problems, such as Independent Set, Vertex Cover, Feedback Vertex Set, Minimum Maximal Matching, Chromatic Number, (l-)Dominating Set, Edge (l-)Dominating Set, and Connected Dominating Set.
To enable this framework, we develop new editing algorithms that find the approximately-fewest edits required to bring a given graph into one of a few important graph classes (in some cases these are bicriteria algorithms which simultaneously approximate both the number of editing operations and the target parameter of the family). For bounded degeneracy, we obtain an O(r log{n})-approximation and a bicriteria (4,4)-approximation which also extends to a smoother bicriteria trade-off. For bounded treewidth, we obtain a bicriteria (O(log^{1.5} n), O(sqrt{log w}))-approximation, and for bounded pathwidth, we obtain a bicriteria (O(log^{1.5} n), O(sqrt{log w} * log n))-approximation. For treedepth 2 (related to bounded expansion), we obtain a 4-approximation. We also prove complementary hardness-of-approximation results assuming P != NP: in particular, these problems are all log-factor inapproximable, except the last which is not approximable below some constant factor 2 (assuming UGC)
- …