Max flow and Matching problem












2












$begingroup$


Where can i find a list of problems reducible to max flow and matching problems. I need such examples to learn and practice .






reductions np-hard approximation







share|cite|improve this question









$endgroup$












  • $begingroup$
    There are some monographs on these topics. On network flow, there is Network Flows: Theory, Algorithms, and Applications. On matching, there's the classic Matching Theory by Lovász and Plummer.
    $endgroup$
    – Yuval Filmus
    3 hours ago
















2












$begingroup$


Where can i find a list of problems reducible to max flow and matching problems. I need such examples to learn and practice .






reductions np-hard approximation







share|cite|improve this question









$endgroup$












  • $begingroup$
    There are some monographs on these topics. On network flow, there is Network Flows: Theory, Algorithms, and Applications. On matching, there's the classic Matching Theory by Lovász and Plummer.
    $endgroup$
    – Yuval Filmus
    3 hours ago














2












2








2





$begingroup$


Where can i find a list of problems reducible to max flow and matching problems. I need such examples to learn and practice .






reductions np-hard approximation







share|cite|improve this question









$endgroup$




Where can i find a list of problems reducible to max flow and matching problems. I need such examples to learn and practice .






reductions np-hard approximation




reductions np-hard approximation






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 4 hours ago









MohbenayMohbenay

576




576












  • $begingroup$
    There are some monographs on these topics. On network flow, there is Network Flows: Theory, Algorithms, and Applications. On matching, there's the classic Matching Theory by Lovász and Plummer.
    $endgroup$
    – Yuval Filmus
    3 hours ago


















  • $begingroup$
    There are some monographs on these topics. On network flow, there is Network Flows: Theory, Algorithms, and Applications. On matching, there's the classic Matching Theory by Lovász and Plummer.
    $endgroup$
    – Yuval Filmus
    3 hours ago
















$begingroup$
There are some monographs on these topics. On network flow, there is Network Flows: Theory, Algorithms, and Applications. On matching, there's the classic Matching Theory by Lovász and Plummer.
$endgroup$
– Yuval Filmus
3 hours ago




$begingroup$
There are some monographs on these topics. On network flow, there is Network Flows: Theory, Algorithms, and Applications. On matching, there's the classic Matching Theory by Lovász and Plummer.
$endgroup$
– Yuval Filmus
3 hours ago










1 Answer
1






active

oldest

votes


















3












$begingroup$

Based on the book "Algorithm Design" by Kleinberg and Tardos, Kevin Wayne has a set of slides (second part here) where the following applications of max flow and matching are presented in some detail:




  • survey design

  • airline scheduling

  • image segmentation

  • project selection

  • baseball elimination

  • assignment problem

  • input-queued switching


For even more examples, have a look into the exercises of Chapter 7 of Kleinberg and Tardos' book, or into the exercises of the book "Network Flows: Theory, Algorithms, and Applications" by Ahuja, Magnanti and Orlin.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    thanks , exactly what i needed to see .
    $endgroup$
    – Mohbenay
    1 hour ago











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "419"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f102939%2fmax-flow-and-matching-problem%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









3












$begingroup$

Based on the book "Algorithm Design" by Kleinberg and Tardos, Kevin Wayne has a set of slides (second part here) where the following applications of max flow and matching are presented in some detail:




  • survey design

  • airline scheduling

  • image segmentation

  • project selection

  • baseball elimination

  • assignment problem

  • input-queued switching


For even more examples, have a look into the exercises of Chapter 7 of Kleinberg and Tardos' book, or into the exercises of the book "Network Flows: Theory, Algorithms, and Applications" by Ahuja, Magnanti and Orlin.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    thanks , exactly what i needed to see .
    $endgroup$
    – Mohbenay
    1 hour ago
















3












$begingroup$

Based on the book "Algorithm Design" by Kleinberg and Tardos, Kevin Wayne has a set of slides (second part here) where the following applications of max flow and matching are presented in some detail:




  • survey design

  • airline scheduling

  • image segmentation

  • project selection

  • baseball elimination

  • assignment problem

  • input-queued switching


For even more examples, have a look into the exercises of Chapter 7 of Kleinberg and Tardos' book, or into the exercises of the book "Network Flows: Theory, Algorithms, and Applications" by Ahuja, Magnanti and Orlin.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    thanks , exactly what i needed to see .
    $endgroup$
    – Mohbenay
    1 hour ago














3












3








3





$begingroup$

Based on the book "Algorithm Design" by Kleinberg and Tardos, Kevin Wayne has a set of slides (second part here) where the following applications of max flow and matching are presented in some detail:




  • survey design

  • airline scheduling

  • image segmentation

  • project selection

  • baseball elimination

  • assignment problem

  • input-queued switching


For even more examples, have a look into the exercises of Chapter 7 of Kleinberg and Tardos' book, or into the exercises of the book "Network Flows: Theory, Algorithms, and Applications" by Ahuja, Magnanti and Orlin.






share|cite|improve this answer











$endgroup$



Based on the book "Algorithm Design" by Kleinberg and Tardos, Kevin Wayne has a set of slides (second part here) where the following applications of max flow and matching are presented in some detail:




  • survey design

  • airline scheduling

  • image segmentation

  • project selection

  • baseball elimination

  • assignment problem

  • input-queued switching


For even more examples, have a look into the exercises of Chapter 7 of Kleinberg and Tardos' book, or into the exercises of the book "Network Flows: Theory, Algorithms, and Applications" by Ahuja, Magnanti and Orlin.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 3 hours ago

























answered 3 hours ago









VincenzoVincenzo

1,6371411




1,6371411












  • $begingroup$
    thanks , exactly what i needed to see .
    $endgroup$
    – Mohbenay
    1 hour ago


















  • $begingroup$
    thanks , exactly what i needed to see .
    $endgroup$
    – Mohbenay
    1 hour ago
















$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
1 hour ago




$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
1 hour ago


















draft saved

draft discarded




















































Thanks for contributing an answer to Computer Science Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f102939%2fmax-flow-and-matching-problem%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Knooppunt Holsloot

Image
Knooppunt Holsloot Kenmerken Wegen A37 × N34 Type knooppunt klaverblad Portaal     Verkeer & Vervoer Knooppunt Holsloot is een verkeersknooppunt op de kruising van de autosnelweg A37 en de N34 in Drenthe, tussen Emmen en Coevorden. Oorspronkelijk was deze aansluiting een afritconstructie van het type Haarlemmermeeraansluiting, zoals bij Knooppunt Hooipolder. Sinds 2002 is het knooppunt omgebouwd tot een volledig klaverblad. Als noviteit werd hier voor het eerst gebruikgemaakt van dimbare verlichting in plaats van de normale vaste tijden waarop de verlichting aan en uit gaat, wat een grote kostenbesparing opleverde. [1] Dat Holsloot als volwaardig knooppunt is uitgevoerd, waarbij alle verkeersstromen en afbuigingen ononderbroken kunnen doorgaan, is uitzonderlijk. Het betreft hier namelijk een aansluiting tussen een autosnelweg en niet-snelweg. Een vergelijkbare situatie treft men nabij Hoensbroek bij het knooppunt Ten Esschen.     Aa
Read more

Altaar (religie)

Image
Deel van de serie over kerkelijk gerei waaronder paramenten en liturgisch vaatwerk gebruikt in de liturgie Liturgisch vaatwerk Vasa sacra Miskelk · Pateen Kelklepeltje Ciborie · Monstrans Pyxis · Custodiale Vasa non sacra Ampullen · Wijwatervat Olievaatje Wierookvat · Ablutievat Paramenten Amict · Albe · Baarkleed · Cingel Tuniek · Dalmatiek · Fanon Kazuifel · Manipel · Stola Gremiale · Benedictievelum Mijter Koorkledij Rochet · Superplie Koorkap · Cappa magna Kovel Kelkgerei Bursa · Kelkvelum Ciborievelum Kerklinnen Corporale · Kelkdoekje Lavabodoekje · Palla Altaardwaal Kerkinterieur Altaar · Ambo Biechtstoel · Communiebank Doksaal · Doopvont Faldistorium Godslamp · Hoogaltaar Heilig Kruisaltaar Katheder · Preekstoel Sedilia Tabernakel · Volksaltaar Liturgische boeken Altaarmissaal Benedictionale · Brevier Evangeliarium · Evangelistarium Graduale · Kyriale Lectionarium Psalter · Rituaal Sacramentarium · Volksmissaal Overige Flambou
Read more

Gregoriusmis

Image
Een afbeelding van de Gregoriusmis uit een getijdenboek gemaakt in de zuidelijke Nederlanden tussen 1500 en 1525 Gregoriusmis, Meester van het Akense Altaar, ca. 1500-1525. Collectie Museum Catharijneconvent De Gregoriusmis of de Mis van Sint Gregorius is een motief in katholieke kunst, dat het eerst verscheen in de late Middeleeuwen en dat nog steeds werd gebruikt tijdens de contrareformatie. Paus Gregorius I (ca. 540-604) is afgebeeld, de H. Mis opdragend, terwijl Christus als de Man van Smarten verschijnt op het altaar dat voor Sint Gregorius staat. Volgens de legende had St. Gregorius gebeden om een teken voor een betwijfelaar van de transsubstantiatieleer, waarop de lijdende Christus tijdens het opdragen van de Mis verscheen om hem te overtuigen en waarbij zijn bloed in de altaarkelk liep. Vaak zijn ook de passiewerktuigen afgebeeld. Zie de categorie Mass of Saint Gregory van Wikimedia Commons voor mediabestanden over dit onderwerp. This page is onl
Read more