On local search and placement of meters in networks

SIAM Journal on Computing

Volumn 32, Issue 2, 2003, Pages 470-487

  Khuller, Samir ^a   Bhatia, Randeep ^b   Pless, Robert ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c WASHINGTON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Feedback sets; Local search; Pressure meters

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

LOCAL SEARCH; PRESSURE-METERS;

GRAPH THEORY;

EID: 0037609045     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799363359     Document Type: Article

References (21)

1. P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoret. Comput. Sci., 237 (2000), pp. 123-134.
2. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms, 12 (1991), pp. 308-340.
3. V. Bafna, P. Berman, and T. Fujito, A 2-approximation algorithm for the undirected feedback vertex set problem, SIAM J. Discrete Math., 12 (1999), pp. 289-297.
4. B. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM, 41 (1994), pp. 153-190.
5. R. Bar-Yehuda, D. Geiger, J. (S.) Naor, and R. M. Roth, Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference, SIAM J. Comput., 27 (1998), pp. 942-959.
6. A. Becker and D. Geiger, Approximation algorithms for the loop cutset problem, in Proceedings of the 10th Conference on Uncertainty in AI, Morgan Kaufmann, San Francisco, 1994, pp. 60-68.
7. H. L. Bodlaender, Some classes of graphs with bounded tree width, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 1988, pp. 116-126.
8. R. B. Borie, R. G. Parker, and C. A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, 7 (1992), pp. 555-581.
9. A. Bhatia, Full Degree Spanning Tree Problem, MS paper, University of Maryland, College Park, MD, 1998.
10. R. Bhatia, S. Khuller, R. Pless, and Y. Sussmann, The full degree spanning tree problem, Networks, 36 (2000), pp. 203-209.
11. H. J. Broersma, A. Huck, T. Kloks, O. Koppius, D. Kratsch, H. Müller, and H. Tuinstra, Degree-preserving forests, Networks, 35 (2000), pp. 26-39.
12. B. Chandra, H. Karloff, and C. Tovey, New results on the old k-opt algorithm for the traveling salesman problem, SIAM J. Comput., 28 (1999), pp. 1998-2029.
13. F. Chudak, M. Goemans, D. Hochbaum, and D. Williamson, Primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs, Oper. Res. Lett., 22 (1998), pp. 111-118.
14. G. Even, J. (S.) Naor, S. Rao, and B. Schieber, Divide-and-conquer approximation algorithms via spreading metrics, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1995, pp. 62-71.
15. M. Goemans and D. Williamson, Primal-dual approximation algorithms for feedback problems in planar graphs, Combinatorica, 18 (1998), pp. 37-59.
16. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
17. J. Kleinberg and A. Kumar, Wavelength conversion in optical networks, J. Algorithms, 38 (2001), pp. 25-50.
18. M. Lewinter, Interpolation theorem for the number of degree-preserving vertices of spanning trees, IEEE Trans. Circuits Systems I Fund. Theory Appl., 34 (1987), p. 205.
19. L. E. Ormsbee, Implicit network calibration, J. Water Resources Planning Management, 115 (1989), pp. 243-257.
20. L. E. Ormsbee and D. J. Wood, Explicit pipe network calibration, J. Water Resources Planning Management, 112 (1986), pp. 116-182.
21. I. W. M. Pothof and J. Schut, Graph-Theoretic Approach to Identifiability in a Water Distribution Network, Memorandum 1283, Universiteit Twente, Twente, The Netherlands, 1995.