-
1
-
-
0002640262
-
Proof verification and intractability of approximation problems
-
October
-
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and intractability of approximation problems," in Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science (FOCS'92), October 1992, pp. 13-23.
-
(1992)
Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science (FOCS'92)
, pp. 13-23
-
-
Arora, S.1
Lund, C.2
Motwani, R.3
Sudan, M.4
Szegedy, M.5
-
2
-
-
21144465703
-
Improving the location of minisum facilities through network modification
-
O. Berman, "Improving the location of minisum facilities through network modification," Annals of Operations Research vol. 40, pp. 1-16, 1992.
-
(1992)
Annals of Operations Research
, vol.40
, pp. 1-16
-
-
Berman, O.1
-
3
-
-
0029519801
-
Free bits, PCPs and non-approximability - Towards tight results
-
M. Bellare, O. Goldreich, and M. Sudan, "Free bits, PCPs and non-approximability - towards tight results," in Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science (FOCS'95), 1995, pp. 422-431.
-
(1995)
Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science (FOCS'95)
, pp. 422-431
-
-
Bellare, M.1
Goldreich, O.2
Sudan, M.3
-
4
-
-
38249035911
-
Linear - Time Computation of Optimal Subgraphs of Decomposable Graphs
-
M. W. Bern, E. L. Lawler and A. L. Wong, "Linear - Time Computation of Optimal Subgraphs of Decomposable Graphs," Journal of Algorithms vol. 8, pp. 216-235, 1987.
-
(1987)
Journal of Algorithms
, vol.8
, pp. 216-235
-
-
Bern, M.W.1
Lawler, E.L.2
Wong, A.L.3
-
5
-
-
0004116989
-
-
McGraw-Hill Book Co.: Cambridge, MA
-
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, McGraw-Hill Book Co.: Cambridge, MA, 1990.
-
(1990)
Introduction to Algorithms
-
-
Cormen, T.H.1
Leiserson, C.E.2
Rivest, R.L.3
-
6
-
-
0002293349
-
Matching, Euler tours and the Chinese postman
-
J. Edmonds and E. L. Johnson, "Matching, Euler tours and the Chinese postman," Mathematical Programming, vol. 5, 88-124, 1973.
-
(1973)
Mathematical Programming
, vol.5
, pp. 88-124
-
-
Edmonds, J.1
Johnson, E.L.2
-
9
-
-
0029289832
-
A general approximation technique for constrained forest problems
-
M. W. Goemans and D. P. Williamson, "A general approximation technique for constrained forest problems," SIAM Journal on Computing vol. 24, pp. 296-317, 1995.
-
(1995)
SIAM Journal on Computing
, vol.24
, pp. 296-317
-
-
Goemans, M.W.1
Williamson, D.P.2
-
10
-
-
0027607736
-
Approximating the minimum maximal independence number
-
M. M. Halldórsson, "Approximating the minimum maximal independence number," Information Processing Letters vol. 46, pp. 169-172, 1993.
-
(1993)
Information Processing Letters
, vol.46
, pp. 169-172
-
-
Halldórsson, M.M.1
-
11
-
-
0002777817
-
Approximation schemes for the restricted shortest path problem
-
R. Hassin, "Approximation schemes for the restricted shortest path problem," Mathematics of Operations Research vol. 17, pp. 36-42, 1992.
-
(1992)
Mathematics of Operations Research
, vol.17
, pp. 36-42
-
-
Hassin, R.1
-
12
-
-
0041663816
-
Edge Weight Reduction Problems in Acyclic graphs
-
S. E. Hambrusch and H. Y. Tu, "Edge Weight Reduction Problems in Acyclic graphs," J. Algorithms vol. 24, pp. 66-93, 1997.
-
(1997)
J. Algorithms
, vol.24
, pp. 66-93
-
-
Hambrusch, S.E.1
Tu, H.Y.2
-
13
-
-
2342586466
-
Modifying Edges of a Network to Obtain Short Subgraphs
-
Accepted for publication
-
S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe, and K. U. Drangmeister, "Modifying Edges of a Network to Obtain Short Subgraphs," Accepted for publication in Theoretical Computer Science. (An extended abstract of this paper titled Modifying networks to obtain low cost trees appeared in Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, Cadenabbia, Italy, Lecture Notes in Computer Science, June 1996, pp. 293-307.)
-
Theoretical Computer Science.
-
-
Krumke, S.O.1
Noltemeier, H.2
Ravi, S.S.3
Marathe, M.V.4
Drangmeister, K.U.5
-
14
-
-
84896748127
-
Modifying networks to obtain low cost trees appeared
-
An extended abstract of this paper titled Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, Cadenabbia, Italy, June
-
S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe, and K. U. Drangmeister, "Modifying Edges of a Network to Obtain Short Subgraphs," Accepted for publication in Theoretical Computer Science. (An extended abstract of this paper titled Modifying networks to obtain low cost trees appeared in Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, Cadenabbia, Italy, Lecture Notes in Computer Science, June 1996, pp. 293-307.)
-
(1996)
Lecture Notes in Computer Science
, pp. 293-307
-
-
-
15
-
-
84951209359
-
Improving Spanning Trees by Upgrading Nodes
-
Bologna, Italy, July
-
S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, "Improving Spanning Trees by Upgrading Nodes," in Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna, Italy, July 1997, pp. 281-291.
-
(1997)
Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97)
, pp. 281-291
-
-
Krumke, S.O.1
Marathe, M.V.2
Noltemeier, H.3
Ravi, R.4
Ravi, S.S.5
Sundaram, R.6
Wirth, H.C.7
-
19
-
-
84958041821
-
Bicriteria network design problems
-
July
-
M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, "Bicriteria network design problems," in Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), July 1995, pp. 487-498.
-
(1995)
Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP'95)
, pp. 487-498
-
-
Marathe, M.V.1
Ravi, R.2
Sundaram, R.3
Ravi, S.S.4
Rosenkrantz, D.J.5
Hunt III, H.B.6
-
21
-
-
0019536824
-
The complexity of designing a network with minimum diameter
-
J. Plesnik, 'The complexity of designing a network with minimum diameter," Networks vol. 11, pp. 77-85, 1981.
-
(1981)
Networks
, vol.11
, pp. 77-85
-
-
Plesnik, J.1
-
22
-
-
21844522079
-
Network upgrading problems
-
D. Paik and S. Sahni, "Network upgrading problems," Networks vol. 26, pp. 45-58, 1995.
-
(1995)
Networks
, vol.26
, pp. 45-58
-
-
Paik, D.1
Sahni, S.2
-
23
-
-
0026366408
-
Optimization, approximation, and complexity classes
-
C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," Journal of computer and system sciences vol. 43, pp. 425-440, 1991.
-
(1991)
Journal of Computer and System Sciences
, vol.43
, pp. 425-440
-
-
Papadimitriou, C.H.1
Yannakakis, M.2
-
24
-
-
2342513238
-
-
Ph.D. thesis, Brown University, Providence, Rhode Island 02912, USA
-
R. Ravi, Steiner trees and beyond, Ph.D. thesis, Brown University, Providence, Rhode Island 02912, USA, 1993.
-
(1993)
Steiner Trees and Beyond
-
-
Ravi, R.1
-
26
-
-
0027148656
-
Many birds with one stone: Multi-objective approximation algorithms
-
May
-
R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, "Many birds with one stone: Multi-objective approximation algorithms," in Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC'93), May 1993, pp. 438-447.
-
(1993)
Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC'93)
, pp. 438-447
-
-
Ravi, R.1
Marathe, M.V.2
Ravi, S.S.3
Rosenkrantz, D.J.4
Hunt III, H.B.5
-
27
-
-
0023207978
-
Approximation of pareto optima in multiple-objective shortest path problems
-
A. Warburton, "Approximation of pareto optima in multiple-objective shortest path problems," Operations Research vol. 35, pp. 70-79, 1992.
-
(1992)
Operations Research
, vol.35
, pp. 70-79
-
-
Warburton, A.1
|