Approximation Algorithms for NP-Hard Problems

@article{Hochba1997ApproximationAF,
  title={Approximation Algorithms for NP-Hard Problems},
  author={Dorit S. Hochba},
  journal={SIGACT News},
  year={1997},
  volume={28},
  pages={40-52}
}
Approximation algorithms have developed in response to the impossibility of solving a great variety of important optimization problems. Too frequently, when attempting to get a solution for a problem, one is confronted with the fact that the problem is NP-hard. This, in the words of Garey and Johnson, means "I can't find an efficient algorithm, but neither can all of these famous people." While this is a significant theoretical step, it hardly qualifies as a cheering piece of news.If the… 

Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds

The techniques used in the approximation algorithm extend beyond distance-based problem to pure connectivity network design problems, and allow for an O(n^{3/5 + \epsilon})-approximation for the Directed Steiner Forest problem when all edges have uniform costs.

On Acquisition and Analysis of Visual Data for Crowdsourcing Disaster Response

A new crowdsourcing framework for acquiring and analyzing the mobile videos utilizing fine granularity spatial metadata of videos for a rapidly changing disaster situation is introduced and an analytical model to quantify the visual awareness of a video based on its metadata is developed.

Effectively crowdsourcing the acquisition and analysis of visual data for disaster response

A new crowdsourcing framework for acquiring and analyzing the mobile videos utilizing fine granularity spatial metadata of videos for a rapidly changing disaster situation is introduced and an analytical model to quantify the visual awareness of a video based on its metadata is developed.

Triangle minimization in large networks

It is shown that the triangle minimization problem under edge (node) attack is a submodular function maximization problem, which can be solved efficiently and proposed is a degree-based edge ( nodes) removal algorithm and a near-optimal greedy edge ( node) removal algorithms.

Algorithms for the Network Analysis of Bilateral Tax Treaties

htmlabstractIn this thesis we conduct a network analysis of bilateral tax treaties. We are given tax data of 108 countries. Companies often send money from country to country via indirect routes,

Euclidean Distance Matrices

Keywords: Euclidean Distance Matrices ; Calibration ; Sensor Localization ; S-stress ; Multidimensional Scaling ; Acoustics ; Heisenberg Uncertainty Principle ; Maximally Compact Sequences These

On the performance of a cavity method based algorithm for the Prize-Collecting Steiner Tree Problem on graphs

A comparison with state-of-the-art algorithms on a wide range of existing benchmarks, networks, and random graphs shows that the cavity algorithm outperforms the two algorithms in most large instances both in running time and quality of the solution.

Approximation algorithms for NP-hard optimization problems

In this chapter, approximation algorithms for optimization problems are discussed, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple.

Scheduling algorithms for efficient delivery of synchronous traffic in wireless access networks

xi

Approximate schedulability analysis

This work introduces the notion of "approximate schedulability analysis" and shows that if a small amount of "error" can be tolerated in decisions made by the algorithm, then this problem can be solved in polynomial time.
...

References

SHOWING 1-8 OF 8 REFERENCES

Semantic Analysis

  • W. Waite
  • Computer Science
    Compiler Construction
  • 1976

Context=Free Grammars And Parsing 95

  • Context=Free Grammars And Parsing 95

Appendix C. Tiny Machine Simulator Listing Bibliography 558 Index

  • Appendix C. Tiny Machine Simulator Listing Bibliography 558 Index

Bottom-up Parsing 197

  • Bottom-up Parsing 197

Appendix B. Tiny Compiler Listing

  • Appendix B. Tiny Compiler Listing

Code Generation 39T

  • Code Generation 39T

Memory Organization During Program Execution 346 / 7.2 Fully Static Runtime Environments 349 / 7.3 Stack-Based Runtime Environments 352 / 7

  • Memory Organization During Program Execution 346 / 7.2 Fully Static Runtime Environments 349 / 7.3 Stack-Based Runtime Environments 352 / 7

Runtime Environments

  • Runtime Environments