On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion

@article{Mishra2015OnTC,
  title={On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion},
  author={Sounaka Mishra and Ashwin Pananjady and N. Safina Devi},
  journal={J. Discrete Algorithms},
  year={2015},
  volume={33},
  pages={71-80}
}
  • Sounaka Mishra, Ashwin Pananjady, N. Safina Devi
  • Published in J. Discrete Algorithms 2015
  • Mathematics, Computer Science
  • In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph $G=(V,E)$ and a specified, or "distinguished" vertex $p \in V$, MDD(min) is the problem of finding a minimum weight vertex set $S \subseteq V\setminus \{p\}$ such that $p$ becomes the minimum degree vertex in $G[V \setminus S]$; and MDD(max) is the problem of finding a minimum weight vertex set $S \subseteq V\setminus \{p\}$ such that $p$ becomes the maximum degree vertex in $G[V… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    1
    Twitter Mention

    References

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

    A new approach for approximating node deletion problems

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Optimization, Approximation, and Complexity Classes

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    The vertex cover P3P3 problem in cubic graphs

    VIEW 2 EXCERPTS

    Construction and analysis of protein–protein interaction networks

    • Karthik Raman
    • Medicine, Computer Science
    • Automated experimentation
    • 2010
    VIEW 1 EXCERPT

    A threshold of ln n for approximating set cover

    VIEW 1 EXCERPT