Counting Matchings and Multi-Stage Optimization of Matchings

Michal Mankowski*, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter, we consider the algorithm A5 for counting matchings and the algorithm A6 for optimization of matchings relative to a weight function. The algorithm of optimization A6 can be used for multi-stage optimization of matchings relative to a sequence of weight functions, and the algorithm A5 can be used for counting the optimal matchings after each step of optimization. This chapter contains some revised results from the conference paper [1].

Original languageEnglish (US)
Title of host publicationStudies in Systems, Decision and Control
PublisherSpringer Science and Business Media Deutschland GmbH
Pages165-172
Number of pages8
DOIs
StatePublished - 2021

Publication series

NameStudies in Systems, Decision and Control
Volume331
ISSN (Print)2198-4182
ISSN (Electronic)2198-4190

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Control and Systems Engineering
  • Automotive Engineering
  • Social Sciences (miscellaneous)
  • Economics, Econometrics and Finance (miscellaneous)
  • Control and Optimization
  • Decision Sciences (miscellaneous)

Fingerprint

Dive into the research topics of 'Counting Matchings and Multi-Stage Optimization of Matchings'. Together they form a unique fingerprint.

Cite this