Approximating Infeasible 2VPI-Systems

Neele Leithäuser, Sven Oliver Krumke, Maximilian Merkert. Approximating Infeasible 2VPI-Systems. In Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern, editors, Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. Volume 7551 of Lecture Notes in Computer Science, pages 225-236, Springer, 2012. [doi]

@inproceedings{LeithauserKM12,
  title = {Approximating Infeasible 2VPI-Systems},
  author = {Neele Leithäuser and Sven Oliver Krumke and Maximilian Merkert},
  year = {2012},
  doi = {10.1007/978-3-642-34611-8_24},
  url = {http://dx.doi.org/10.1007/978-3-642-34611-8_24},
  researchr = {https://researchr.org/publication/LeithauserKM12},
  cites = {0},
  citedby = {0},
  pages = {225-236},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers},
  editor = {Martin Charles Golumbic and Michal Stern and Avivit Levy and Gila Morgenstern},
  volume = {7551},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-34610-1},
}