Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Gramm, J.; Hirsch, E.A.; Niedermeier, R.; Rossmanith, P.
Discrete Appl. Math 130(2): 139-155
2003
ISSN/ISBN: 0166-218X Accession: 078869056
PDF emailed within 1 workday: $29.90
Related References
Correa, G.O.; Sales, D.M. 2006: On upper bounds on worst-case H2 performance obtained with dynamic multipliers International Journal of Control 79(8): 918-937Nock, R.; Nielsen, F. 2004: On domain-partitioning induction criteria: worst-case bounds for the worst-case based Theoretical Computer Science 321(2-3): 371-382
Gafni, Y.; Lavi, R.; Tennenholtz, M. 2021: Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation Journal of Artificial Intelligence Research 72: 99-135
Gruber, J.; Ramirez, D.; Alamo, T.; Camacho, E. 2011: Min–Max MPC based on an upper bound of the worst case cost with guaranteed stability. Application to a pilot plant Journal of Process Control 21(1): 194-204
Suresh, G.O.V.I.N.D.A.C.H.A.R. 1983: Worst case reliability bounds Microelectronics and Reliability 23(5): 855-856
Fishman, G.S.; Rubin, D.S. 1992: Evaluating Best-Case and Worst-Case Coefficients of Variation when Bounds Are Available Probability in the Engineering and Informational Sciences 6(3): 309-322
Fishman, G.S.; Granovsky, B.L.; Rubin, D.S. 1992: Evaluating best-case and worst-case variances when bounds are available Siam Journal on Scientific and Statistical Computing 13(6): 1347-1360
Rubin, F. 1975: Worst Case Bounds for Maximal Compatible Subsets IEEE Transactions on Computers C-24(8): 830-831
Klve, T. 1995: Bounds on the worst case probability of undetected error IEEE Transactions on Information Theory 41(1): 298-300
Fishman, G.S.; Rubin, D.S. 1998: Best- and worst-case variances when bounds are available for the distribution function Computational Statistics and Data Analysis 29(1): 35-53
Kaplan, E.H. 1991: Mean-max bounds for worst-case endemic mixing models Mathematical Biosciences 105(1): 97-109
Mao, W. 1993: Tight worst-case performance bounds for next-k-fit bin packing Siam Journal on Computing 22(1): 46-56
Avis, D. 1981: Worst case bounds for the Euclidean matching problem Computers-Mathematics with Applications 7(3): 251-257
Kaplan, E.H. 1992: R0 bounds for worst-case endemic mixing models Mathematical Biosciences 110(1): 131-132
Gavoille, C.; Guevremont, E. 1998: Worst case bounds for shortest path interval routing Journal of Algorithms 27(1): 1-25
Kwon, R.H. 2005: Data dependent worst case bounds for weighted set packing European Journal of Operational Research 167(1): 68-76
Yufei, T.A.O.; Yi, Y.A.N.G.; Xiaocheng, H.U.; Cheng, S.H.E.N.G.; Shuigeng, Z.H.O.U. 2014: Instance-level worst-case query bounds on R-trees The Vldb Journal 23(4): 591-607
Tao, Y.; Yang, Y.; Hu, X.; Sheng, C.; Zhou, S. 2013: Instance-level worst-case query bounds on R-trees The VLDB Journal 23(4): 591-607
Feder, T.; Motwani, R. 2002: Worst-case time bounds for coloring and satisfiability problems Journal of Algorithms 45(2): 192-201
Hausmann, D.; Korte, B. 1978: Lower bounds on the worst-case complexity of some oracle algorithms Discrete Mathematics 24(3): 261-276