Share This Author
On Some Tighter Inapproximability Results
- P. Berman, M. Karpinski
- Computer Science, MathematicsElectron. Colloquium Comput. Complex.
- 1 June 1998
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurrence satisfiability problems like MAX-2SAT and E2-LIN-2, and…
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- V. Bafna, P. Berman, Toshihiro Fujito
- Mathematics, Computer ScienceSIAM J. Discret. Math.
- 1 September 1999
A simple and efficient approximation algorithm with performance ratio of at most 2 is presented, improving previous best bounds for either weighted or unweighted cases of the vertex cover problem.
Power efficient monitoring management in sensor networks
- P. Berman, G. Calinescu, C. Shah, A. Zelikovsky
- Computer ScienceIEEE Wireless Communications and Networking…
- 21 March 2004
This work forms the problem of maximizing sensor network lifetime, i.e., time during which the monitored area is (partially or fully) covered, and proposes efficient provably good centralized algorithms for sensor monitoring schedule maximizing the total lifetime.
On Some Tighter Inapproximability Results (Extended Abstract)
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurence satisfiability problems like MAX-2SAT and E2-LIN-2, and…
Improved approximations for the Steiner tree problem
An approximation algorithm is given and it is shown that the worst-case ratio of the cost of the solutions to the optimal cost is better than previously known ratios in graphs, and in rectilinear metric on the plane.
1.375-Approximation Algorithm for Sorting by Reversals
By exploiting the polynomial time algorithm for sorting signed permutations and by developing a new approximation algorithm for maximum cycle decomposition of breakpoint graphs, a new 1.375-algorithm for the MIN-SBR problem is designed.
On-line algorithms for Steiner tree problems (extended abstract)
This work presents an algorithm for the on-line Generalized Steiner Tree (GST) problem, and two other problems: Rectilinear Steiner Arborescence(RSA) and Symmetric Rectil inear Steer arborescence (SRSA), with performance ratios of O(log n).
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
- P. Berman
- Mathematics, Computer ScienceNord. J. Comput.
- 1 September 2000
This paper describes an algorithm with running time polynomial in |V|d that finds an independent set A such that w(A*)/w(A) ≤ d/2, where A* is an independent that maximizes w (A*).
Fast Sorting by Reversal
This paper exploits a few combinatorial properties of the cycle graph of a permutation and proposes an O(n2α(n) implementation of the algorithm where α is the inverse Ackerman function and improves implementations of the other rearrangement distance problems.
HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs
- Youngjae Kim, Aayush Gupta, B. Urgaonkar, P. Berman, A. Sivasubramaniam
- Computer ScienceIEEE 19th Annual International Symposium on…
- 25 July 2011
A hybrid system called Hybrid Store is designed and evaluated to provide improved capacity planning technique to administrators with the overall goal of operating within cost-budgets and improved performance/lifetime guarantees during episodes of deviations from expected workloads through two novel mechanisms: write-regulation and fragmentation busting.