Publication
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This chapter contains sections titled: Introduction Related problems Preliminaries and notation Complexity and (in) approximability Graphs of Δ = 2 A 2-approximation algorithm for general graphs Bipartite graphs Conclusions Bibliography