• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Time-Space trade-off algorithms for sensor networks

Publicly Offered Research

Project AreaA multifaceted approach toward understanding the limitations of computation
Project/Area Number 15H00855
Research Category

Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)

Allocation TypeSingle-year Grants
Review Section Science and Engineering
Research InstitutionTohoku University

Principal Investigator

Korman Matias  東北大学, 情報科学研究科, 助教 (80732718)

Project Period (FY) 2015-04-01 – 2017-03-31
Project Status Completed (Fiscal Year 2016)
Budget Amount *help
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2016: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2015: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
KeywordsAlgorithms / Time-Space Trade-off / Computational Geometry / Computer Science / Memory Constrains / Simple Polygons / Sensor Networks / Memory Constrained
Outline of Annual Research Achievements

The project has been very fruitful, both from a theoretical and a practical point of view. All planned milestones have been achieved.

On one hand, we have found several interesting theoretical trade-offs. Some of which are specific techniques for fundamental problems, but others are general methods that can be used for more than one problem. Overall, with the help of this project we have accomplished over 25 publications in peer reviewed conferences and international journals (several of which appeared in top theory conferences). In addition, we have initiated or strengthened ties with more than 20 other research centers, most of them outside Japan.

From a practical point of view, we have also implemented the compressed stack technique as we planned. The code has been done with the help of other researchers within Tohoku University. Code has been released as open source (it is currently available at https://github.com/Azzaare/CompressedStacks.jl). We have run experiments to verify the performance of the data structure. As expected, the data structure uses very little memory. In addition, we have observed that the running time is quite good. Details of these experiments will be submitted for publication in the following months.

Research Progress Status

28年度が最終年度であるため、記入しない。

Strategy for Future Research Activity

28年度が最終年度であるため、記入しない。

Report

(2 results)
  • 2016 Annual Research Report
  • 2015 Annual Research Report
  • Research Products

    (27 results)

All 2017 2016 2015 Other

All Journal Article (11 results) (of which Int'l Joint Research: 9 results,  Peer Reviewed: 10 results,  Acknowledgement Compliant: 10 results,  Open Access: 3 results) Presentation (13 results) (of which Int'l Joint Research: 13 results) Book (2 results) Remarks (1 results)

  • [Journal Article] Stabbing segments with rectilinear objects2017

    • Author(s)
      M. Claverol, D. Garijo, M. Korman, C. Seara, and R. Silveira
    • Journal Title

      Applied Mathematics and Computation

      Volume: 1 Pages: 1-19

    • Related Report
      2016 Annual Research Report
    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] On interference among moving sensors and related problems2017

    • Author(s)
      J.-L. De Carufel, M. J. Katz, M. Korman, A. van Renssen, M. Roeloffzen, and S. Smorodinsky
    • Journal Title

      Journal of Computational Geometry

      Volume: 1 Pages: 1-14

    • Related Report
      2016 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] Computing the L1 geodesic diameter and center of a polygonal domain2017

    • Author(s)
      S. W. Bae, M. Korman, J. S. B. Mitchell, Y. Okamoto, V. Polishchuk, and H. Wang. . , pages 1-28, 2016
    • Journal Title

      Discrete & Computational Geometry

      Volume: 57(3) Issue: 3 Pages: 674-701

    • DOI

      10.1007/s00454-016-9841-z

    • Related Report
      2016 Annual Research Report
    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] A linear-time algorithm for the geodesic center of a simple polygon2016

    • Author(s)
      H.-K. Ahn, L. Barba, P. Bose, J.-L. De Carufel, M. Korman, and E. Oh
    • Journal Title

      Discrete & Computational Geometry

      Volume: 56(4) Issue: 4 Pages: 836-859

    • DOI

      10.1007/s00454-016-9796-0

    • Related Report
      2016 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] Minimum dual diameter triangulations.2016

    • Author(s)
      M. Korman, S. Langerman, W. Mulzer, A. Pilz, and B. Vogtenhuber.
    • Journal Title

      Computational Geometry: Theory and Applications (in press)

      Volume: 1

    • Related Report
      2015 Annual Research Report
    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] The 1-center and 1-highway problem revisited.2015

    • Author(s)
      J. M. Diaz-Banez, M. Korman, P. Perez-Lantero, and I. Ventura.
    • Journal Title

      Annals of Operations Research

      Volume: 1 Issue: 1-2 Pages: 1-13

    • DOI

      10.1007/s10479-015-1790-z

    • Related Report
      2016 Annual Research Report 2015 Annual Research Report
    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] Computing the L1 geodesic diameter and center of a simple polygon in linear time.2015

    • Author(s)
      S. W. Bae, M. Korman, Y. Okamoto, and H. Wang.
    • Journal Title

      Computational Geometry: Theory and Applications

      Volume: 48(6) Issue: 6 Pages: 495-505

    • DOI

      10.1016/j.comgeo.2015.02.005

    • Related Report
      2015 Annual Research Report
    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] Space-time trade-offs for stack-based algorithms.2015

    • Author(s)
      L. Barba, M. Korman, S. Langerman, K. Sadakane, and R. Silveira.
    • Journal Title

      Algorithmica

      Volume: 72(4) Issue: 4 Pages: 1097-1129

    • DOI

      10.1007/s00453-014-9893-5

    • Related Report
      2015 Annual Research Report
    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] Balanced partitions of 3-colored geometric sets in the plane2015

    • Author(s)
      S. Bereg, F. Hurtado, M.Kano, M. Kormand, D. Lara, C.Seara, R. Silveira, J. Urrutia, K.Verbeek
    • Journal Title

      Discrete Applied Mathematics

      Volume: 181 Pages: 21-32

    • DOI

      10.1016/j.dam.2014.10.015

    • Related Report
      2015 Annual Research Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] Cannibal Animal Games: a new variant of Tic-Tac-Toe2015

    • Author(s)
      J. Cardinal, S. Collette, H. Ito, H. Sakaidani, M. Korman, S. Langerman, and P. Taslakian.
    • Journal Title

      Journal of Information Processing

      Volume: 23 Issue: 3 Pages: 265-271

    • DOI

      10.2197/ipsjjip.23.265

    • NAID

      130005070057

    • ISSN
      1882-6652
    • Related Report
      2015 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] New results on stabbing segments with a polygon.2015

    • Author(s)
      J. M. Diaz-Banez, M. Korman, P. Perez-Lantero, A. Pilz, C. Seara, and R. I. Silveira.
    • Journal Title

      Computational Geometry: Theory and Applications

      Volume: 48(1) Issue: 1 Pages: 14-29

    • DOI

      10.1016/j.comgeo.2014.06.002

    • Related Report
      2015 Annual Research Report
  • [Presentation] Improved time-space trade-offs for computing voronoi diagrams2017

    • Author(s)
      B. Banyassady, M. Korman, W. Mulzer, A. v. Renssen, M. Roeloffzen, P. Seiferth, and Y. Stein.
    • Organizer
      34th Symposium on Theoretical Aspects of Computer Science (STACS'17)
    • Place of Presentation
      Hannover (germany)
    • Year and Date
      2017-03-08
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Packing short plane spanning trees in complete geometric graphs2016

    • Author(s)
      O. Aichholzer, T. Hackl, M. Korman, A. Pilz, G. Rote, A. van Renssen, M. Roeloffzen, and B. Vogtenhuber
    • Organizer
      27th International Symposium on Algorithms and Computation (ISAAC'16)
    • Place of Presentation
      Sydney (Australia)
    • Year and Date
      2016-12-12
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Symmetric assembly puzzles are hard, beyond a few pieces2016

    • Author(s)
      E. D. Demaine, M. Korman, J. S. Ku, J. S. B. Mitchell, Y. Otachi, A. van Renssen, M. Roeloffzen, R. Uehara, and Y. Uno
    • Organizer
      18th Discrete and Computational Geometry and Graphs (JCDCGG 2015)
    • Place of Presentation
      Kyoto University (Kyoto)
    • Year and Date
      2016-09-14
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research
  • [Presentation] On interference among moving sensors and related problems.2016

    • Author(s)
      J.-L. De Carufel, M. J. Katz, M. Korman, A. van Renssen, M. Roeloffzen, and S. Smorodinsky
    • Organizer
      24th European Symposium on Algorithms (ESA'16)
    • Place of Presentation
      Aarhus (Denmark)
    • Year and Date
      2016-08-22
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Hanabi is np-complete, even for cheaters who look at their cards2016

    • Author(s)
      J. Baffier, M. Chiu, Y. Diez, M. Korman, V. Mitsou, A. van Renssen, M. Roeloffzen, and Y. Uno.
    • Organizer
      International Conference on Fun with Algorithms
    • Place of Presentation
      La Maddalena, Italy
    • Year and Date
      2016-08-08
    • Related Report
      2015 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Time-space trade-offs for triangulating a simple polygon2016

    • Author(s)
      B. Aronov, M. Korman, S. Pratt, A. van Renssen, and M. Roeloffzen.
    • Organizer
      15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'16)
    • Place of Presentation
      Reykjavik (Iceland)
    • Year and Date
      2016-06-22
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Time-space trade-offs for triangulating a simple polygon.2016

    • Author(s)
      B. Aronov, M. Korman, S. Pratt, A. van Renssen, and M. Roeloffzen.
    • Organizer
      Scandinavian Symposium and Workshops on Algorithm Theory
    • Place of Presentation
      Reikjavik, Iceland
    • Year and Date
      2016-06-22
    • Related Report
      2015 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Hanabi is NP-complete, even for cheaters who look at their cards2016

    • Author(s)
      J. Baffier, M. Chiu, Y. Diez, M. Korman, V. Mitsou, A. van Renssen, M. Roeloffzen, and Y. Uno
    • Organizer
      8th International Conference on Fun with Algorithms (FUN'16)
    • Place of Presentation
      La Maddalena (Italy)
    • Year and Date
      2016-06-08
    • Related Report
      2016 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Computing the L1 geodesic diameter and center of a polygonal domain2016

    • Author(s)
      S. W. Bae, M. Korman, J. S. B. Mitchell, Y. Okamoto, V. Polishchuk, and H. Wang.
    • Organizer
      Symposium on Theoretical Aspects of Computer Science
    • Place of Presentation
      Orleans, United States of America
    • Year and Date
      2016-02-20
    • Related Report
      2015 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Line segment covering of cells in arrangements.2015

    • Author(s)
      M. Korman, M. Roeloffzen, and S.-H. Poon
    • Organizer
      Annual International Conference on Combinatorial Optimization and Applications
    • Place of Presentation
      Houston, United States of America
    • Year and Date
      2015-12-18
    • Related Report
      2015 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Stabbing segments with rectilinear objects2015

    • Author(s)
      M. Claverol, D. Garijo, M. Korman, C. Seara, and R. Silveira.
    • Organizer
      Symposium on Fundamentals of Computation Theory
    • Place of Presentation
      Gdansk, Poland
    • Year and Date
      2015-08-17
    • Related Report
      2015 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Time-space trade-offs for triangulations and voronoi diagrams2015

    • Author(s)
      M. Korman, W. Mulzer, M. Roeloffzen, A. v. Renssen, P. Seiferth, and Y. Stein
    • Organizer
      Algorithms and Data Structures Symposium
    • Place of Presentation
      Victoria, Canada
    • Year and Date
      2015-08-07
    • Related Report
      2015 Annual Research Report
    • Int'l Joint Research
  • [Presentation] A linear-time algorithm for the geodesic center of a simple polygon2015

    • Author(s)
      H.-K. Ahn, L. Barba, P. Bose, J.-L. D. Carufel, M. Korman, and E. Oh.
    • Organizer
      Symposium on Computational geometry
    • Place of Presentation
      Utrecht, Netherlands
    • Year and Date
      2015-06-23
    • Related Report
      2015 Annual Research Report
    • Int'l Joint Research
  • [Book] Memory-constrained algorithms2016

    • Author(s)
      M. Korman
    • Publisher
      Springer
    • Related Report
      2016 Annual Research Report
  • [Book] Memory-Constrained Algorithms2015

    • Author(s)
      Matias Korman
    • Publisher
      Springler
    • Related Report
      2015 Annual Research Report
  • [Remarks] Implementation of the Compressed Stack

    • URL

      https://github.com/Azzaare/CompressedStacks.jl

    • Related Report
      2016 Annual Research Report

URL: 

Published: 2015-04-16   Modified: 2018-03-28  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi