2019 Fiscal Year Research-status Report
Approximation algorithms in environments with uncertainty
| Project/Area Number |
19K20216
|
|---|
| Research Institution | National Institute of Informatics |
|---|
Principal Investigator |
シュワルツマン グレゴリー 国立情報学研究所, ビッグデータ数理国際研究センター, 特任研究員 (20815261)
|
|---|
| Project Period (FY) |
2019-04-01 – 2021-03-31
|
| Keywords | Distributed computing / Graph algorithms / Approximation algorithms |
|---|
| Outline of Annual Research Achievements |
During 2019 I've published the following two papers:Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Parameterized Distributed Algorithms. DISC 2019: 6:1-6:16
;Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. DISC 2019: 5:1-5:15
DISC is one of two top conferences in the field of theory of distributed computing. The paper "Optimal Distributed Covering Algorithms" was also presented as a brief announcement at PODC 2019. I traveled to the conferences and gave the oral presentations.I've also given an invited talk titled "Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks" at DiADN workshop co-located with DISC 2019.I also co-organized a Shonan workshop on distributed graph algorithms
|
| Current Status of Research Progress |
Current Status of Research Progress
2: Research has progressed on the whole more than it was originally planned.
Reason
Apart from the papers already published, together with my collaborators we have some strong preliminary results regarding fundamental problems such as matching, independent set and vertex cover in the distributed setting. Specifically, we have results for highly dynamic networks which are a much stronger generalization of the current (static) model used in distributed computing.
I hope to publish the above during 2020, progressing the current state of the project.
|
| Strategy for Future Research Activity |
I plan to continue working on extending our results for the highly dynamic setting, as this model of computation can be highly useful in modeling real world distributed systems. I aim to continue studying fundamental problems such as matching, and other cpmbinatorial optimization problems in this model. I plan to submit these results to leading conferences such as PODC and DISC.
|
