Skip to main content
SpringerLink
Log in

Approximating a Class of Classification Problems

  • Chapter
Book cover Efficient Approximation and Online Algorithms

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3484))

  • 1029 Accesses

Abstract

We consider a general classification problem, also known as labeling problem, which is strongly related to several standard classification frameworks and has applications in various computer science domains. In this chapter, we put together and review known results coming from application domains as well as recent advances on the approximability of the problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Archer, A., Fakcharoenphol, J., Harrelson, C., Krauthgamer, R., Talwar, K., Tardos, E.: Approximate classification via earthmover metrics. In: Proc. 17th SODA, pp. 1079–1087 (2004)

    Google Scholar 

  2. Arora, S., Karger, D.R., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. In: Proc. 27th STOC, pp. 284–293 (1995)

    Google Scholar 

  3. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proc. 37th FOCS, pp. 184–193 (1996)

    Google Scholar 

  4. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proc. 30th STOC, pp. 161–168 (1998)

    Google Scholar 

  5. Bertsimas, D., Teo, C.P., Vohra, R.: Nonlinear formulations and improved randomized approximation algorithms for multicut problems. In: Proc. 4th IPCO, pp. 29–39 (1995)

    Google Scholar 

  6. Besag, J.: Spatial interaction and the statistical analysis of lattice systems. Journal Royal Statistics Society B 36 (1974)

    Google Scholar 

  7. Besag, J.: On the statistical analysis of dirty images. Journal Royal Statistics Society B 48, 259–302 (1986)

    Google Scholar 

  8. Billionnet, A., Costa, M.C., Sutter, A.: An efficient algorithm for a task allocation problem. J. ACM 39, 502–518 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bokhari, S.H.: A sortest tree algorithm for optimal assignments across space and time in a distributed processor system. IEEE Trans. Soft. Eng. SE 7, 583–589 (1981)

    Article  Google Scholar 

  10. Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proc. IEEE International Conference on Computer Vision and Pattern Recognition, pp. 648–655 (1998)

    Google Scholar 

  11. Boykov, Y., Veksler, O., Zabih, R.: A New Algorithm for Energy Minimization with Discontinuities. In: Hancock, E.R., Pelillo, M. (eds.) EMMCVPR 1999. LNCS, vol. 1654, pp. 205–220. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  12. Boykov, Y., Veksler, O., Zabih, R.: Fast Approximate Energy Minimization via Graph Cuts. In: Proc. 7th IEEE International Conference on Computer Vision, ICCV 1999, vol. 1, pp. 377–384 (1999)

    Google Scholar 

  13. Burkard, R.E., Cela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Pardalos, P.M., Du, D.-Z. (eds.) Handbook of Combinatorial Optimization, pp. 241–338. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  14. Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. In: Proc. 30th STOC, pp. 48–52 (1998); JCSS 60, 564–574 (2000)

    Google Scholar 

  15. Calinescu, G., Karloff, H., Rabani, Y.: Approximation algorithms for the 0-extension problem. In: Proc. 12th SODA, pp. 8–16 (2001)

    Google Scholar 

  16. Chakrabarti, S., Dom, B., Indyk, P.: Enhanced hypertext categorization using hyperlinks. In: Proc. ACM SIGMOD Intern. Conf. on Management of Data, pp. 307–318 (1998)

    Google Scholar 

  17. Charikar, M., Chekuri, C., Goel, A., Guha, S.: Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median. In: Proc. 30th STOC, pp. 114–123 (1998)

    Google Scholar 

  18. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proc. 39th FOCS, pp. 379–388 (1998)

    Google Scholar 

  19. Chekuri, C., Khanna, S., Naor, J., Zosin, L.: Approximation algorithms for the metric labeling problem via a new linear programming formulation. In: Proc. 12th SODA, pp. 109–118 (2001)

    Google Scholar 

  20. Chellappa, R.: Markov Random Fields: Theory and Applications. Academic Press, London (1993)

    Google Scholar 

  21. Cherh, M.S., Chen, G.H., Liu, P.: An LC branch-and-bound algorithm for the module assignment problem. Information Processing Leters 32, 61–71 (1989)

    Article  Google Scholar 

  22. Chopra, S., Owen, L.H.: Extended formulations of the A-cut problem, preprint (1994)

    Google Scholar 

  23. Chopra, S., Rao, M.R.: On the multiway cut polyhedron. Networks 21, 51–89 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  24. Chuzhoy, J., Naor, J.: The Hardness of Metric Labeling. In: Proc. 45th FOCS, pp. 108–114 (2004)

    Google Scholar 

  25. Cohen, F.S.: Markov Random Fields for image modeling and analysis. In: Desai, U.B. (ed.) Modeleling and Applications of Stochastic Processes, Kluwer, Dordrecht (1986)

    Google Scholar 

  26. Cunningham, W.H.: The optimal multiterminal cut problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 5, pp. 105–120 (1991)

    Google Scholar 

  27. Cunningham, W.H., Tang, L.: Optimal 3-terminal cuts and linear programming. In: Proc. 7th IPCO, pp. 114–125 (1999)

    Google Scholar 

  28. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P., Yannakakis, M.: The complexity of multiterminal cuts, Preliminary abstract (1983). In: Proc. 24th STOC, pp. 241–251 (1983); SIAM J. Computing 23, 864–894 (1994)

    Google Scholar 

  29. Della Pietra, S., Della Pietra, V., Lafferty, J.D.: Inducing features of random fields. IEEE Trans. on Pattern Analysis and Machine Intelligence 19, 380–393 (1997)

    Article  Google Scholar 

  30. Dubes, R., Jain, A.: Random field models in image analysis. J. Applied Statistics 16 (1989)

    Google Scholar 

  31. Dietterich, T.G.: Machine-learning research. AI Magazine 18, 97–136 (1997)

    Google Scholar 

  32. Erdös, P., Székely, L.A.: Algorithms and min-max theorems for certain multiway cut problems. In: Balas, E., Gornuéjols, G., Kannan, R. (eds.) Integer Programming and Combonatorial Optimization, Graduate Scholl of Industrial Administation, Garnegie-Mellon Univeristy, pp. 334–345 (1992)

    Google Scholar 

  33. Erdös, P., Székely, L.A.: On weigthed multiway cuts in tress. Mathematical Programming 65, 93–105 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  34. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proc. 35th STOC, pp. 448–455 (2003)

    Google Scholar 

  35. Fernádez-Baca, D.: Allocating modules to processors in a distributed system. IEEE Trans. Soft. Eng. SE-15, 1427–1436 (1989)

    Article  Google Scholar 

  36. Fernandez de la Vega, W., Lamari, M.: The task allocation problem with constant communication, Rapport de Recherche no. 1048, L.R.I., Université de Paris Sud (1996); To appear in Discrete Applied Mathematics

    Google Scholar 

  37. Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

  38. Freund, A., Karloff, H.: A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut. Information Processing Letters 75, 43–50 (2000)

    Article  MathSciNet  Google Scholar 

  39. Frieze, A.M., Kannan, R.: The regularity lemma and approximation schemes for dense problems. In: Proc. 37th FOCS, pp. 12–20 (1996)

    Google Scholar 

  40. Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol. 700, pp. 64–75. Springer, Heidelberg (1993)

    Google Scholar 

  41. Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Computing 25, 235–251 (1996); also in Proc. 25th STOC, pp. 698-707 (1993)

    Google Scholar 

  42. Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 487–498. Springer, Heidelberg (1994)

    Google Scholar 

  43. Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. on Pattern Analysis and Machine Intelligence 6, 721–741 (1984)

    Article  MATH  Google Scholar 

  44. Cohen, F.S.: Markov random fields for image modelling and analysis. In: Desai, U.B. (ed.) Modeling and Applications od Stochastic Processes. Kluwer Academic Publishers, Dordrecht (1986)

    Google Scholar 

  45. Goldschmidt, O., Hochbaum, D.S.: A polynomial algorithm for the k-cut problem for fixed k. Mathematics of Operations Research 35, 24–37 (1998)

    MathSciNet  Google Scholar 

  46. Greig, D., Potrteous, B.T., Seheult, A.: Exact minimum a posteriori estimation of binary images. Journal Royal Statistics Society B 51, 271–279 (1989)

    Google Scholar 

  47. Gupta, A., Tardos, E.: A constant factor approximation algorithm for a class of classification problems. In: Proc. 32th STOC, pp. 652–658 (2000)

    Google Scholar 

  48. He, X.: An improved algorithm for the planar 3-cut problem. J. of Algorithms 12, 23–37 (1991)

    Article  MATH  Google Scholar 

  49. Hochbaum, D.S., Shmoys, D.B.: An O(|V|2) algorithm for the planar 3-cut problem. SIAM J. Algebraic and Discrete Methods 6, 707–712 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  50. Hu, T.C.: Integer Programming and Network Flows. Addison- Wesley Publishing Co., Reading (1969)

    MATH  Google Scholar 

  51. Ishikawa, H., Geiger, D.: Segmentation by grouping junctions. In: Proc. IEEE International Conference on Computer Vision and Pattern Recognition, pp. 125–131 (1998)

    Google Scholar 

  52. Karger, D.R., Klein, P.N., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding of minimum multiway cut. In: Proc. 29th STOC, pp. 668–678 (1999)

    Google Scholar 

  53. Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM 43, 601–640 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  54. Karzanov, A.V.: Minimum 0-extension of grpah metrics. European J. of Combinatorics 19, 71–101 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  55. Karzanov, A.V.: A combinatorial algorithm for the minimum (2,r)-metric problem and some generalizations. Combinatorica 18, 549–568 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  56. Kinderman, R., Snell, J.: Markov random Fields and their Applications. AMS Press (1980)

    Google Scholar 

  57. Klein, P.N., Agrawal, A., Ravi, R., Rao, S.: Approximation through multicommodity flow. In: Proc. 31st FOCS, pp. 726–737 (1990)

    Google Scholar 

  58. Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: Metric lableling and Markov random fierlds. In: Proc. 40th FOCS, pp. 14–23 (1999)

    Google Scholar 

  59. Kopidakis, Y., Lamari, M., Zissimopoulos, V.: On the task assignment problem: Two new efficient heuristic algorithms. J. of Parallel and Distributed Computing 42, 21–29 (1997)

    Article  Google Scholar 

  60. Lee, C.H., Lee, D., Kim, M.: Optimal task assignment in linear array networks. IEEE Transanctions on Computers TSC-41, 877–880 (1992)

    Google Scholar 

  61. Li, S.Z.: Markov Random Field Modelling in Computer Vision. Springer, Heidelberg (1995)

    Google Scholar 

  62. Lo, V.M.: Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Comp. TSC-37, 1384–1397 (1988)

    Article  Google Scholar 

  63. Magirou, V.F.: An improved partial solution to the task assignment and multiway cut problems. Operations Research Letters 12, 3–10 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  64. Magirou, V.F., Milis, J.Z.: An algorithm for the multiprocessor assignment problem. Operations Research Letters 8, 351–356 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  65. Milis, I.: Task assignment in distributed systems using network flow methods. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol. 1120, pp. 396–405. Springer, Heidelberg (1996)

    Google Scholar 

  66. Milis, I., Magirou, V.F.: A Lagrangian relaxation algorithm for sparse quadratic assignment problems. Operations Research Letters 17, 69–76 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  67. Naor, J., Zosin, L.: A 2-approximation algorithm for the directed multiway cut problem. In: Proc. 38th FOCS, pp. 548–553 (1997)

    Google Scholar 

  68. Roy, S., Cox, I.J.: A maximum-flow formulation of the N-camera stereo correspondence problem. In: Proc. 6th IEEE International Conference on Computer Vision, ICCV 1998, pp. 492–499 (1998)

    Google Scholar 

  69. Saran, H., Vazirani, V.V.: Finding k-cuts within twice the optimal. In: Proc. 32nd FOCS, pp. 743–751 (1991)

    Google Scholar 

  70. Sinclair, J.B.: Efficient computation of optimal assignment for distributed tasks. J. Paral. and Distr. Comput. 4, 342–362 (1987)

    Article  Google Scholar 

  71. Stone, H.S.: Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. on Software Engineering SE-3, 85–93 (1977)

    Article  Google Scholar 

  72. Tardos, E., Vazirani, V.V.: Improved bounds for the max-flow min-multicut ratio for planar and K r,r -free graphs. Information Processing Letters 47, 77–80 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  73. Towsley, D.F.: Allocating programs containing branches and loops within a multiple processor system. IEEE Trans. Soft. Eng. SE-12, 1018–1024 (1986)

    Google Scholar 

  74. Vazirani, V.V.: Approximation algorithms. Springer, Berlin (2001)

    Google Scholar 

  75. Veksler, O.: Efficient graph-based energy minimization methods in computer vision, Ph. D. Thesis, Department of Computer Science, Cornell University (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Athens University of Economics and Business, Patission 76, 10434, Athens, Greece

    Ioannis Milis

Authors
  1. Ioannis Milis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Boulevard François Mitterand, 91025, Evry Cedex, France

    Evripidis Bampis

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Brown University, 02918, Providence, RI, USA

    Claire Kenyon

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Milis, I. (2006). Approximating a Class of Classification Problems. In: Bampis, E., Jansen, K., Kenyon, C. (eds) Efficient Approximation and Online Algorithms. Lecture Notes in Computer Science, vol 3484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671541_8

Download citation

  • DOI: https://doi.org/10.1007/11671541_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32212-2

  • Online ISBN: 978-3-540-32213-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation