-
1
-
-
0025463248
-
Linear algorithm for optimal path cover problem on interval graphs
-
S. R. Arikati and C. Pandu Rangan. Linear algorithm for optimal path cover problem on interval graphs. Inf. Process. Lett., 35(3):149-153, 1990.
-
(1990)
Inf. Process. Lett.
, vol.35
, Issue.3
, pp. 149-153
-
-
Arikati, S.R.1
Pandu Rangan, C.2
-
2
-
-
0030413554
-
Polynomial time approximation schemes for euclidean traveling sales- man and other geometric problems
-
IEEE Computer Society
-
S. Arora. Polynomial time approximation schemes for euclidean traveling sales- man and other geometric problems. In Proc. 37th Annual IEEE Symposium on Foundations of Computer Science, pages 2-11. IEEE Computer Society, 1996.
-
(1996)
In Proc. 37Th Annual IEEE Symposium on Foundations of Computer Science
, pp. 2-11
-
-
Arora, S.1
-
3
-
-
0004140739
-
-
Springer-Verlag, Berlin Heidelberg
-
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer-Verlag, Berlin Heidelberg, 1999.
-
(1999)
Complexity and Approximation
-
-
Ausiello, G.1
Crescenzi, P.2
Gambosi, G.3
Kann, V.4
Marchetti-Spaccamela, A.5
Protasi, M.6
-
4
-
-
0028255806
-
Approximation algorithms for NP-complete problems on planar graphs
-
B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41(1):153-180, 1994.
-
(1994)
Journal of the ACM
, vol.41
, Issue.1
, pp. 153-180
-
-
Baker, B.S.1
-
5
-
-
0028462698
-
Linear approximation of shortest superstrings
-
A. Blum, M. Li, J. Tromp, and M. Yannakakis. Linear approximation of shortest superstrings. Journal of the ACM, 41(4):630-647, 1994.
-
(1994)
Journal of the ACM
, vol.41
, Issue.4
, pp. 630-647
-
-
Blum, A.1
Li, M.2
Tromp, J.3
Yannakakis, M.4
-
6
-
-
0016141284
-
On covering the points of a graph with point disjoint paths
-
Springer, Berlin
-
F. T. Boesch, S. Chen, and J. A. M. McHugh. On covering the points of a graph with point disjoint paths. In Lecture Notes in Mathematics, volume 46, pages 201-212. Springer, Berlin, 1974.
-
(1974)
In Lecture Notes in Mathematics
, vol.46
, pp. 201-212
-
-
Boesch, F.T.1
Chen, S.2
McHugh, J.A.3
-
7
-
-
0018457209
-
Minimum node disjoint path covering for circular-arc graphs
-
M. A. Bonuccelli and D. P. Bovet. Minimum node disjoint path covering for circular-arc graphs. Inf. Process. Lett., 8:159-161, 1979.
-
(1979)
Inf. Process. Lett.
, vol.8
, pp. 159-161
-
-
Bonuccelli, M.A.1
Bovet, D.P.2
-
8
-
-
0028517406
-
A short note on the approximability of the maximum leaves spanning tree problem
-
G. Galbiati, F. Ma_oli, and A. Morzenti. A short note on the approximability of the maximum leaves spanning tree problem. Inf. Process. Lett., 52:45-49, 1994.
-
(1994)
Inf. Process. Lett.
, vol.52
, pp. 45-49
-
-
Galbiati, G.1
Ma_Oli, F.2
Morzenti, A.3
-
10
-
-
0016532202
-
Advances on the Hamiltonian completion problem
-
S. E. Goodman, S. T. Hedetniemi, and P. J. Slater. Advances on the Hamiltonian completion problem. Journal of the ACM, 22(3):352-360, 1975.
-
(1975)
Journal of the ACM
, vol.22
, Issue.3
, pp. 352-360
-
-
Goodman, S.E.1
Hedetniemi, S.T.2
Slater, P.J.3
-
11
-
-
0016560084
-
Fast approximation algorithms for the knapsack and sum of subset problems
-
O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 22(4):463-468, 1975.
-
(1975)
Journal of the ACM
, vol.22
, Issue.4
, pp. 463-468
-
-
Ibarra, O.H.1
Kim, C.E.2
-
12
-
-
0005075377
-
A linear algorithm for the Hamiltonian completion number of a tree
-
S. Kundu. A linear algorithm for the Hamiltonian completion number of a tree. Inf. Process. Lett., 5:55-57, 1976.
-
(1976)
Inf. Process. Lett.
, vol.5
, pp. 55-57
-
-
Kundu, S.1
-
14
-
-
0347259053
-
Optimal chain partitions of trees
-
J. Misra and R. E. Tarjan. Optimal chain partitions of trees. Inf. Process. Lett., 4:24-26, 1975.
-
(1975)
Inf. Process. Lett.
, vol.4
, pp. 24-26
-
-
Misra, J.1
Tarjan, R.E.2
-
15
-
-
0026366408
-
Optimization, approximation, and com- plexity classes
-
C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and com- plexity classes. J. Comput. Syst. Sci., 43:425-440, 1991.
-
(1991)
J. Comput. Syst. Sci.
, vol.43
, pp. 425-440
-
-
Papadimitriou, C.H.1
Yannakakis, M.2
-
17
-
-
0016973706
-
P-complete approximation problems
-
S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the ACM, 23(3):555-565, 1976.
-
(1976)
Journal of the ACM
, vol.23
, Issue.3
, pp. 555-565
-
-
Sahni, S.1
Gonzalez, T.2
-
18
-
-
0346047469
-
Path partitions of vertices and Hamiltonicity of graphs
-
Prague
-
Z. Skupien. Path partitions of vertices and Hamiltonicity of graphs. In Proc. 2nd Czechoslovakian Symp. on Graph Theory, pages 481-491, Prague, 1974.
-
(1974)
Proc. 2Nd Czechoslovakian Symp. On Graph Theory
, pp. 481-491
-
-
Skupien, Z.1
-
19
-
-
0027627276
-
Optimal path cover problem on block graphs and bipartite permutation graphs
-
R. Srikant, R. Sundaram, K. S. Singh, and C. P. Rangan. Optimal path cover problem on block graphs and bipartite permutation graphs. Theoretical Computer Science, 115(2):351-357, 1993.
-
(1993)
Theoretical Computer Science
, vol.115
, Issue.2
, pp. 351-357
-
-
Srikant, R.1
Sundaram, R.2
Singh, K.S.3
Rangan, C.P.4
-
20
-
-
0346613586
-
Optimal path cover problem on block graphs
-
P.-K. Wong. Optimal path cover problem on block graphs. Theoretical Computer Science, 225(1-2):163-169, 1999.
-
(1999)
Theoretical Computer Science
, vol.225
, Issue.1-2
, pp. 163-169
-
-
Wong, P.-K.1
-
22
-
-
0028714891
-
The path-partition problem in block graphs
-
J. H. Yan and G. J. Chang. The path-partition problem in block graphs. Inf. Process. Lett., 52:317-322, 1994
-
(1994)
Inf. Process. Lett.
, vol.52
, pp. 317-322
-
-
Yan, J.H.1
Chang, G.J.2
|