Skip to main content
SpringerLink
Log in

COAP 2019 Best Paper Prize: Paper of Andreas Tillmann

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Arellano, J.D., Hicks, I.V.: Degree of redundancy of linear systems using implicit set covering. IEEE Trans. Autom. Sci. Eng. 11(1), 274–279 (2014)

    Article  Google Scholar 

  2. Cho, J.J., Chen, Y., Ding, Y.: On the (Co)Girth of a connected matroid. Discrete Appl. Math. 155(18), 2456–2470 (2007)

    Article  MathSciNet  Google Scholar 

  3. Egner, S., Minkwitz, T.: Sparsification of rectangular matrices. J. Symb. Comput. 26(2), 135–149 (1998)

    Article  MathSciNet  Google Scholar 

  4. Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Applied and Numerical Harmonic Analysis. Birkhäuser, Basel (2013)

    MATH  Google Scholar 

  5. Kianfar, K., Pourhabib, A., Ding, Y.: An integer programming approach for analyzing the measurement redundancy in structured linear systems. IEEE Trans. Autom. Sci. Eng. 8(2), 447–450 (2011)

    Article  Google Scholar 

  6. Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455–500 (2009)

    Article  MathSciNet  Google Scholar 

  7. Manikas, A., Proukakis, C.: Modeling and estimation of ambiguities in linear arrays. IEEE Trans. Signal Process. 46(8), 2166–2179 (1998)

    Article  Google Scholar 

  8. Puchert, C., Tillmann, A.M.: Exact separation of forbidden-set cuts associated with redundant parity checks of binary linear codes. IEEE Commun. Lett. 24(10), 2096–2099 (2020)

    Article  Google Scholar 

  9. Tillmann, A.M.: Computing the spark: mixed-integer programming for the (vector) matroid girth problem. Comput. Optim. Appl. 74(2), 387–441 (2019)

    Article  MathSciNet  Google Scholar 

  10. Tillmann, A.M., Pfetsch, M.E.: The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing. IEEE Trans. Inf. Theory 60(2), 1248–1259 (2014)

    Article  MathSciNet  Google Scholar 

  11. Zhu, Z., So, A.M.C., Ye, Y.: Fast and near-optimal matrix completion via randomized basis pursuit. In: Ji, L., Poon, Y.S., Yang, L., Yau, S.T. (eds.) Proceedings of 5th ICCM, AMS/IP Studies in Advanced Mathematics, vol. 51, pp. 859–882. AMS and International Press (2012)

Download references

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

COAP 2019 Best Paper Prize: Paper of Andreas Tillmann. Comput Optim Appl 77, 623–626 (2020). https://doi.org/10.1007/s10589-020-00235-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-020-00235-6

Search

Navigation