Guruswami, Venkatesan; Rangan, C. Pandu A natural family of optimization problems with arbitrarily small approximation thresholds. (English) Zbl 1339.68118 Inf. Process. Lett. 68, No. 5, 241-248 (1998). MSC: 68Q25 68Q17 68W25 90C35 90C59 90C60 PDFBibTeX XMLCite \textit{V. Guruswami} and \textit{C. P. Rangan}, Inf. Process. Lett. 68, No. 5, 241--248 (1998; Zbl 1339.68118) Full Text: DOI Link
Vedantham, Sundararajan; Iyengar, S. S. The Bandwidth Allocation Problem in the ATM network model is NP-complete. (English) Zbl 1339.68107 Inf. Process. Lett. 65, No. 4, 179-182 (1998). MSC: 68Q17 68M10 PDFBibTeX XMLCite \textit{S. Vedantham} and \textit{S. S. Iyengar}, Inf. Process. Lett. 65, No. 4, 179--182 (1998; Zbl 1339.68107) Full Text: DOI Link
Paik, Doowon; Reddy, Sudhakar; Sahni, Sartaj Vertex splitting in dags and applications to partial scan designs and lossy circuits. (English) Zbl 1320.94116 Int. J. Found. Comput. Sci. 9, No. 4, 377-398 (1998). MSC: 94C15 05C85 68Q17 PDFBibTeX XMLCite \textit{D. Paik} et al., Int. J. Found. Comput. Sci. 9, No. 4, 377--398 (1998; Zbl 1320.94116) Full Text: DOI
Schwarz, S.; Krumke, S. O. On budget-constrained flow improvement. (English) Zbl 1078.68641 Inf. Process. Lett. 66, No. 6, 291-297 (1998). MSC: 68Q25 90C35 PDFBibTeX XMLCite \textit{S. Schwarz} and \textit{S. O. Krumke}, Inf. Process. Lett. 66, No. 6, 291--297 (1998; Zbl 1078.68641) Full Text: DOI
Low, Chor Ping A fast search algorithm for the quorumcast routing problem. (English) Zbl 1078.68596 Inf. Process. Lett. 66, No. 2, 87-92 (1998). MSC: 68M20 68T20 PDFBibTeX XMLCite \textit{C. P. Low}, Inf. Process. Lett. 66, No. 2, 87--92 (1998; Zbl 1078.68596) Full Text: DOI
Hohzaki, Ryusuke; Iida, Koji; Kiyama, Masaki Randomized look strategy for a moving target when a search path is given. (English) Zbl 0998.90514 J. Oper. Res. Soc. Japan 41, No. 3, 374-386 (1998). MSC: 90B40 93E03 49K45 91A25 PDFBibTeX XMLCite \textit{R. Hohzaki} et al., J. Oper. Res. Soc. Japan 41, No. 3, 374--386 (1998; Zbl 0998.90514) Full Text: DOI
Wagner, H. Computational complexity of infinite-valued Łukasiewicz propositional logic. (English) Zbl 0990.03016 Chong, C. T. (ed.) et al., Proceedings of the 6th Asian logic conference, Beijing, China, May 20-24, 1996. Singapore: World Scientific. 273-284 (1998). MSC: 03B50 03D15 PDFBibTeX XMLCite \textit{H. Wagner}, in: Proceedings of the 6th Asian logic conference, Beijing, China, May 20--24, 1996. Singapore: World Scientific; Singapore: Singapore University Press. 273--284 (1998; Zbl 0990.03016)
Haddad, L.; Hell, P.; Mendelsohn, E. On the complexity of coloring areflexive \(h\)-ary relations with given permutation group. (English) Zbl 0964.05023 Ars Comb. 48, 111-128 (1998). Reviewer: Jan Kratochvíl (Praha) MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{L. Haddad} et al., Ars Comb. 48, 111--128 (1998; Zbl 0964.05023)
Morales-Luna, Guillermo; de Ita Luna, Guillermo Approximation algorithms for MaxSAT. (English) Zbl 0970.68119 Bank, Bernd (ed.) et al., 3rd international conference on approximation and optimization in the Caribbean, Puebla, México, October 8-13, 1995. México: Sociedad Matemática Mexicana. Aportaciones Mat., Comun. 24, 163-174 (1998). MSC: 68R05 68T15 PDFBibTeX XMLCite \textit{G. Morales-Luna} and \textit{G. de Ita Luna}, Aportaciones Mat., Comun. 24, 163--174 (1998; Zbl 0970.68119) Full Text: EMIS
Baaz, Matthias; Hájek, Petr; Krajíček, Jan; Švejda, David Embedding logics into product logic. (English) Zbl 0962.03019 Stud. Log. 61, No. 1, 35-47 (1998). MSC: 03B50 03B52 03D15 68Q17 PDFBibTeX XMLCite \textit{M. Baaz} et al., Stud. Log. 61, No. 1, 35--47 (1998; Zbl 0962.03019) Full Text: DOI
Cherry, Kathleen G.; Brigham, Robert C. Preliminary results on greatest common subgraphs. (English) Zbl 0952.05033 Congr. Numerantium 134, 67-78 (1998). MSC: 05C35 05C85 PDFBibTeX XMLCite \textit{K. G. Cherry} and \textit{R. C. Brigham}, Congr. Numerantium 134, 67--78 (1998; Zbl 0952.05033)
Bulitko, V. K.; Bulitko, V. V. On a criterion of \({\mathcal N}P\)-completeness. (English. Russian original) Zbl 0968.68515 Ukr. Math. J. 50, No. 12, 1924-1928 (1998); translation from Ukr. Mat. Zh. 50, No. 12, 1686-1691 (1998). MSC: 68Q15 PDFBibTeX XMLCite \textit{V. K. Bulitko} and \textit{V. V. Bulitko}, Ukr. Mat. Zh. 50, No. 12, 1 (1998; Zbl 0968.68515); translation from Ukr. Mat. Zh. 50, No. 12, 1686--1691 (1998) Full Text: DOI
Vu, Van H. On the infeasibility of training neural networks with small mean-squared error. (English) Zbl 0981.68138 IEEE Trans. Inf. Theory 44, No. 7, 2892-2900 (1998). Reviewer: Iveta Mrázová (Praha) MSC: 68T05 PDFBibTeX XMLCite \textit{V. H. Vu}, IEEE Trans. Inf. Theory 44, No. 7, 2892--2900 (1998; Zbl 0981.68138) Full Text: DOI Link
Breuer, Florian; Robson, John Michael Strategy and complexity of the game of Squares. (English) Zbl 0932.68055 Bull. Lond. Math. Soc. 30, No. 3, 274-282 (1998). MSC: 68Q25 PDFBibTeX XMLCite \textit{F. Breuer} and \textit{J. M. Robson}, Bull. Lond. Math. Soc. 30, No. 3, 274--282 (1998; Zbl 0932.68055) Full Text: DOI
Koshelev, Misha; Longpré, Luc; Taillibert, Patrick Optimal enclosure of quadratic interval functions. (English) Zbl 0942.65046 Reliab. Comput. 4, No. 4, 351-360 (1998). Reviewer: S.Markov (Sofia) MSC: 65G30 65Y20 68Q17 PDFBibTeX XMLCite \textit{M. Koshelev} et al., Reliab. Comput. 4, No. 4, 351--360 (1998; Zbl 0942.65046) Full Text: DOI
Hartmann, Stephan; Schäffter, Markus W.; Schulz, Andreas S. Switchbox routing in VLSI design: Closing the complexity gap. (English) Zbl 0913.68101 Theor. Comput. Sci. 203, No. 1, 31-49 (1998). MSC: 68W35 68M99 PDFBibTeX XMLCite \textit{S. Hartmann} et al., Theor. Comput. Sci. 203, No. 1, 31--49 (1998; Zbl 0913.68101) Full Text: DOI
Lakeev, A. V. An exact upper estimate of the spectral radius of nonexpanding matrices. (Russian) Zbl 0906.65043 Vychisl. Tekhnol. 3, No. 2, 21-30 (1998). Reviewer: V.F.Murzina (Novosibirsk) MSC: 65F30 65G30 65F15 65F40 PDFBibTeX XMLCite \textit{A. V. Lakeev}, Vychisl. Tekhnol. 3, No. 2, 21--30 (1998; Zbl 0906.65043)
Iwama, Kazuo; Nozoe, Mitsushi; Yajima, Shuzo Optimizing OBDDs is still intractable for monotone functions. (English) Zbl 1031.68539 Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24-28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 625-635 (1998). Reviewer: U.Schöning (Ulm) MSC: 68Q25 94C10 PDFBibTeX XMLCite \textit{K. Iwama} et al., Lect. Notes Comput. Sci. 1450, 625--635 (1998; Zbl 1031.68539)
Papadimitriou, Christos H.; Steiglitz, Kenneth Combinatorial optimization: algorithms and complexity. Corr. repr. of the 1982 original. (English) Zbl 0944.90066 Mineola, NY: Dover Publications, Inc. xvi, 496 p. (1998). Reviewer: H.-C.Wirth (Würzburg) MSC: 90C27 90-01 90C05 90C46 90C35 90C10 90B10 90C57 90C59 90C60 68Q25 PDFBibTeX XMLCite \textit{C. H. Papadimitriou} and \textit{K. Steiglitz}, Combinatorial optimization: algorithms and complexity. Corr. repr. of the 1982 original. Mineola, NY: Dover Publications, Inc. (1998; Zbl 0944.90066)
Chor, Benny; Sudan, Madhu A geometric approach to betweenness. (English) Zbl 0912.68058 SIAM J. Discrete Math. 11, No. 4, 511-523 (1998). MSC: 68W25 68U05 68W40 90C22 PDFBibTeX XMLCite \textit{B. Chor} and \textit{M. Sudan}, SIAM J. Discrete Math. 11, No. 4, 511--523 (1998; Zbl 0912.68058) Full Text: DOI
Malajovich, Gregorio; Meer, Klaus On the structure of \(\text{NP}_{\mathbb C}\). (English) Zbl 0915.68069 SIAM J. Comput. 28, No. 1, 27-35 (1998). MSC: 68Q15 03D15 68Q05 PDFBibTeX XMLCite \textit{G. Malajovich} and \textit{K. Meer}, SIAM J. Comput. 28, No. 1, 27--35 (1998; Zbl 0915.68069) Full Text: DOI
Portier, Natacha Universal resolution for NP-complete problems. (Résolutions universelles pour des problèmes NP-complets.) (French) Zbl 0911.68102 Theor. Comput. Sci. 201, No. 1-2, 137-150 (1998). MSC: 68Q45 PDFBibTeX XMLCite \textit{N. Portier}, Theor. Comput. Sci. 201, No. 1--2, 137--150 (1998; Zbl 0911.68102) Full Text: DOI
Middendorf, Martin Shortest common superstrings and scheduling with coordinated starting times. (English) Zbl 0895.68009 Theor. Comput. Sci. 191, No. 1-2, 205-214 (1998). MSC: 68M20 PDFBibTeX XMLCite \textit{M. Middendorf}, Theor. Comput. Sci. 191, No. 1--2, 205--214 (1998; Zbl 0895.68009) Full Text: DOI
Jansen, Klaus Approximation results for the optimum cost chromatic partition problem. (English) Zbl 0895.68098 Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 143-168 (1998). Reviewer: Liu Yanpei (Beijing) MSC: 68R10 PDFBibTeX XMLCite \textit{K. Jansen}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 143--168 (1998; Zbl 0895.68098)
Bürgisser, Peter On the structure of Valiant’s complexity classes. (English) Zbl 0894.68061 Morvan, Michel (ed.) et al., STACS 98. 15th annual symposium on Theoretical aspects of computer science. Paris, France, February 25–27, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1373, 194-204 (1998). MSC: 68Q15 PDFBibTeX XMLCite \textit{P. Bürgisser}, Lect. Notes Comput. Sci. 1373, 194--204 (1998; Zbl 0894.68061)
Hedetniemi, Stephen T.; McRae, Alice A.; Parks, Dolores A. Complexity results. (English) Zbl 0891.68050 Haynes, Teresa W. (ed.) et al., Domination in graphs. Advanced topics. New York, NY: Marcel Dekker. Pure Appl. Math., Marcel Dekker. 209, 233-269 (1998). MSC: 68Q25 68Q15 68R10 05C85 05C35 PDFBibTeX XMLCite \textit{S. T. Hedetniemi} et al., in: Domination in graphs. Advanced topics. New York, NY: Marcel Dekker. 233--269 (1998; Zbl 0891.68050)
Cook, William J.; Cunningham, William H.; Pulleyblank, William R.; Schrijver, Alexander Combinatorial optimization. (English) Zbl 0909.90227 Wiley-Interscience Series in Discrete Mathematics and Optimization. New York, NY: Wiley. x, 355 p. (1998). Reviewer: D.Kratsch (Jena) MSC: 90C27 90-02 90C35 90B10 90C10 PDFBibTeX XMLCite \textit{W. J. Cook} et al., Combinatorial optimization. New York, NY: Wiley (1998; Zbl 0909.90227)