1 / 41

A Primal-Dual Approach to the Feedback Vertex Set Problem

A Primal-Dual interpretation of two 2-approximation algorithms for the Feedback Vertex Set problem in undirected graphs. Written byFabian A. Chudak,Michel X. Goemans,Dorit S. Hochbaum,David P. Williamson.. Outline. Problem definitionRelated workNew linear programsA primal-dual algorithmEquiv

infinity
Download Presentation

A Primal-Dual Approach to the Feedback Vertex Set Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. A Primal-Dual Approach to the Feedback Vertex Set Problem Presented by: Yuval Mishory Oren Ben Zwi ????? ???? ??? 2 ?????????? ?????? ?????? ? fvs (?????? ????) ?????? ?????? ?"? ????? ????? ? - primal dual, ?????? ???????? ???? ?????? ?????. ????? ?? ????? ???? ?????? ???????? ???? ????? ??? "??? ?????" ??? ?-2 (?????? ????? ??????? ?????? ???? ????????).????? ???? ??? 2 ?????????? ?????? ?????? ? fvs (?????? ????) ?????? ?????? ?"? ????? ????? ? - primal dual, ?????? ???????? ???? ?????? ?????. ????? ?? ????? ???? ?????? ???????? ???? ????? ??? "??? ?????" ??? ?-2 (?????? ????? ??????? ?????? ???? ????????).

    2. A Primal-Dual interpretation of two 2-approximation algorithms for the Feedback Vertex Set problem in undirected graphs Written by Fabian A. Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson. ?? ??????? ?????

    3. Outline Problem definition Related work New linear programs A primal-dual algorithm Equivalence to two previous algorithms

    4. The (fvs) Feedback Vertex Set problem for undirected graphs Given an undirected graph G(V, E) and nonnegative weights wv for the vertices, find a subset F of V s.t. F meets every cycle of G. The minimum fvs (Feedback Vertex Set) problem is finding a minimum weight fvs. ?????? ??? ???? ?????? ?"? ????? ???? fvs ??? ??????? ??????? ??? ??? ????????? ??? ???? ?????? ?"? ????? ???? fvs ??? ??????? ??????? ??? ??? ???

    5. The classic IP formulation of FVS

More Related