2-edge connected subgraph problem, complete description

Basit Öğe Kaydı
dc.contributor.authorMeziane, Aider
dc.contributor.authorLamia, Aoudia
dc.date.accessioned2024-07-12T20:50:10Z
dc.date.available2024-07-12T20:50:10Z
dc.date.issued2009en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractOur work focus on node weighted 2-edge connected subgraph problem defined by Baiou [?]. Given a graph G = (V, E), a node r ? V and cost (weight) function on nodes and edges, the r-2-edge connected subgraph problem consists on finding a 2-edge connected subgraph in G containing r whose total cost (weight) on both nodes and edges is minimized. We study a class of graphs for which the polytope associated to the r-2-edge connected subgraph problem is completely described by the trivial inequalities and the inequalities so called generalized cut inequalities. After that, we investigate a class of valid inequalities given by Baiou and Correa in the case of cordless multi-cycle graphs.en_US
dc.identifier.citationMeziane, A. ve Lamia, A. (2009). 2-edge connected subgraph problem, complete description. Maltepe Üniversitesi. s. 75.en_US
dc.identifier.endpage76en_US
dc.identifier.isbn9.78605E+12
dc.identifier.startpage75en_US
dc.identifier.urihttps://www.maltepe.edu.tr/Content/Media/CkEditor/03012019014112056-AbstractBookICMS2009Istanbul.pdf#page=76
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2286
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciencesen_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY07613
dc.title2-edge connected subgraph problem, complete descriptionen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu