Max flow and Matching problem
Clash Royale CLAN TAG#URR8PPP
$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
asked Jan 16 at 12:32
MohbenayMohbenay
747
$endgroup$
add a comment |
$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
asked Jan 16 at 12:32
MohbenayMohbenay
747
$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
Jan 16 at 13:34
add a comment |
$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
asked Jan 16 at 12:32
MohbenayMohbenay
747
$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
asked Jan 16 at 12:32
MohbenayMohbenay
747
asked Jan 16 at 12:32
MohbenayMohbenay
747
asked Jan 16 at 12:32
MohbenayMohbenay
747
asked Jan 16 at 12:32
MohbenayMohbenay
747
asked Jan 16 at 12:32
MohbenayMohbenay
747
747
$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
Jan 16 at 13:34
add a comment |
$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
Jan 16 at 13:34
$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
Jan 16 at 13:34
$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
Jan 16 at 13:34
add a comment |
1 Answer
1
active
oldest
votes
$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.
answered Jan 16 at 13:37
VincenzoVincenzo
1,7321513
$endgroup$
$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
Jan 16 at 16:07
add a comment |
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$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.
answered Jan 16 at 13:37
VincenzoVincenzo
1,7321513
$endgroup$
$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
Jan 16 at 16:07
add a comment |
$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.
answered Jan 16 at 13:37
VincenzoVincenzo
1,7321513
$endgroup$
$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
Jan 16 at 16:07
add a comment |
$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.
answered Jan 16 at 13:37
VincenzoVincenzo
1,7321513
$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.
answered Jan 16 at 13:37
VincenzoVincenzo
1,7321513
edited Jan 16 at 13:43
answered Jan 16 at 13:37
VincenzoVincenzo
1,7321513
answered Jan 16 at 13:37
VincenzoVincenzo
1,7321513
answered Jan 16 at 13:37
VincenzoVincenzo
1,7321513
1,7321513
$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
Jan 16 at 16:07
add a comment |
$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
Jan 16 at 16:07
$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
Jan 16 at 16:07
$begingroup$
thanks , exactly what i needed to see .
$endgroup$
– Mohbenay
Jan 16 at 16:07
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$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
Jan 16 at 13:34