Corpus ID: 209140276

Multistage Problems on a Global Budget

@article{Heeger2019MultistagePO,
  title={Multistage Problems on a Global Budget},
  author={Klaus Heeger and Anne-Sophie Himmel and Frank Kammer and Rolf Niedermeier and Malte Renken and Andrej Sajenko},
  journal={ArXiv},
  year={2019},
  volume={abs/1912.04392}
}
  • Klaus Heeger, Anne-Sophie Himmel, +3 authors Andrej Sajenko
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is among the most natural frameworks. Roughly speaking, herein one studies the different (time) layers of a temporal graph (effectively meaning that the edge set may change over time, but the vertex set remains unchanged), and one searches for a solution of a given graph problem for each layer. The twist in the multistage… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 13 REFERENCES

    Multistage Vertex Cover

    VIEW 1 EXCERPT

    Multistage Knapsack

    VIEW 1 EXCERPT

    Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

    VIEW 2 EXCERPTS

    Online Multistage Subset Maximization Problems

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Multistage matchings. In Proceedings of 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), volume 101 of LIPIcs, pages 7:1–7:13

    • Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos
    • Schloss Dagstuhl - Leibniz- Zentrum fr Informatik,
    • 2018
    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL