文献
J-GLOBAL ID:202202255563000885
整理番号:22A0902416
マッチングとマトロイド交差問題における辞書的最大解による近似【JST・京大機械翻訳】
Approximation by lexicographically maximal solutions in matching and matroid intersection problems
著者 (4件):
Berczi Kristof
(MTA-ELTE Momentum Matroid Optimization Research Group and MTA-ELTE Egervary Research Group, Department of Operations Research, Eotvos Lorand University, Budapest, Hungary)
,
Kiraly Tamas
(MTA-ELTE Momentum Matroid Optimization Research Group and MTA-ELTE Egervary Research Group, Department of Operations Research, Eotvos Lorand University, Budapest, Hungary)
,
Yamaguchi Yutaro
(Department of Information and Physical Sciences, Graduate School of Information Science and Technology, Osaka University, Osaka, Japan)
,
Yokoi Yu
(Principles of Informatics Research Division, National Institute of Informatics, Tokyo, Japan)
資料名:
Theoretical Computer Science
(Theoretical Computer Science)
巻:
910
ページ:
48-53
発行年:
2022年
JST資料番号:
T0022A
ISSN:
0304-3975
CODEN:
TCSDIQ
資料種別:
逐次刊行物 (A)
記事区分:
短報
発行国:
オランダ (NLD)
言語:
英語 (EN)