Skip to main content
SpringerLink
Log in

Consistent Subset Problem with Two Labels

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2018)

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

Included in the following conference series:

Abstract

In this paper, we prove that the consistent subset problem with two labels is NP-complete.

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 EPUB and 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

References

  1. de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187–206 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hart, P.E.: The condensed nearest neighbor rule (corresp.). IEEE Trans. Inf. Theor. 14(3), 515–516 (1968)

    Article  Google Scholar 

  3. Masuyama, S., Ibaraki, T., Hasegawa, T.: The computational complexity of the m-center problems on the plane. IEICE Trans. (1976–1990) 64(2), 57–64 (1981)

    Google Scholar 

  4. Ritter, G.L., Woodruff, H.B., Lowry, S.R., Isenhour, T.L.: An algorithm for a selective nearest neighbor decision rule (corresp.). IEEE Trans. Inf. Theor. 21(6), 665–669 (1975)

    Article  MATH  Google Scholar 

  5. Wilfong, G.T.: Nearest neighbor problems. Int. J. Comput. Geom. Appl. 2(4), 383–416 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Mach. Learn. 38(3), 257–286 (2000)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Alberta, Edmonton, Canada

    Kamyar Khodamoradi

  2. School of Computing Science, Simon Fraser University, Burnaby, Canada

    Ramesh Krishnamurti

  3. Faculty of Informatics, Masaryk University, Brno, Czech Republic

    Bodhayan Roy

Authors
  1. Kamyar Khodamoradi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ramesh Krishnamurti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bodhayan Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bodhayan Roy .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Delhi, New Delhi, India

    B.S. Panda

  2. University of Calcutta, Kolkata, India

    Partha P. Goswami

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Khodamoradi, K., Krishnamurti, R., Roy, B. (2018). Consistent Subset Problem with Two Labels. In: Panda, B., Goswami, P. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2018. Lecture Notes in Computer Science(), vol 10743. Springer, Cham. https://doi.org/10.1007/978-3-319-74180-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-74180-2_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-74179-6

  • Online ISBN: 978-3-319-74180-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation