New approximation techniques for some linear ordering problems

SIAM Journal on Computing

Volumn 34, Issue 2, 2005, Pages 388-404

  Rao, Satish ^a   Richa, Andréa W ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Arizona State University   (United States)

Author keywords

Approximation algorithms; Interval graph completion; Minimum linear arrangement; Spreading metrics; Storage time product

Indexed keywords

APPROXIMATION ALGORITHMS; INTERVAL GRAPH COMPLETION; MINIMUM LINEAR ARRANGEMENTS; SPREADING METRICES; STORAGE-TIME PRODUCTS;

ALGORITHMS; FUNCTIONS; GRAPHIC METHODS; LINEAR SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION THEORY;

EID: 18444402512     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702413197     Document Type: Article

References (15)

1. C. F. BORNSTEIN AND S. VEMPALA, Flow metrics, in Proceedings of LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Lecture Notes in Comput. Sci. 2286, Springer-Verlag, Berlin, 2002, pp. 516-527.
2. G. EVEN, J. NAOR, S. RAO, AND B. SCHIEBER, Fast approximate graph partitioning algorithms, SIAM J. Comput., 28 (1999), pp. 2187-2214.
3. G. EVEN, J. NAOR, S. RAO, AND B. SCHIEBER, Divide-and-conquer approximation algorithms via spreading metrics, J. ACM, 47 (2000), pp. 585-616.
4. G. EVEN, J. NAOR, B. SCHIEBER, AND M. SUDAN, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20 (1998), pp. 151-174.
5. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
6. M. HANSEN, Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems, in Proceedings of the 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 604-609.
7. D. G. KENDALL, Incidence matrices, interval graphs, and seriation in archeology, Pacific J. Math., 28 (1969), pp. 565-570.
8. P. KLEIN, S. PLOTKIN, AND S. RAO, Excluded minors, network decomposition, and multicommodity flow, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 682-690.
9. R. KOCH, T. LEIGHTON, B. MAGGS, S. RAO, AND A. ROSENBERG, Work-preserving emulations of fixed-connection networks, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, ACM, New York, 1989, pp. 227-240.
10. F. T. LEIGHTON AND S. RAO, Multicommodity max-fiow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46 (1999), pp. 787-832.
11. J. MEIDANIS AND J. C. SETUBAL, Introduction to Computational Molecular Biology, PWS, Boston, MA, 1997.
12. G. RAMALINGAM AND C. P. RANGAN, A unified approach to domination problems in interval graphs, Inform. Process. Lett., 27 (1988), pp. 271-274.
13. S. RAO AND A. W. RICHA, New approximation techniques for some ordering problems, in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1988, pp. 211-218.
14. R. RAVI, A. AGRAWAL, AND P. KLEIN, Ordering problems approximated: Single-processor scheduling and interval graph completion, in Proceedings of the 18th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 510, Springer-Verlag, Berlin, 1991, pp. 751-762.
15. P. D. SEYMOUR, Packing directed circuits fractionally, Combinatorica, 15 (1995), pp. 281-288.