z-logo
open-access-imgOpen Access
Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints
Author(s) -
Anh Viet,
Frank Neumann
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i14.17458
Subject(s) - matroid , submodular set function , mathematical optimization , mathematics , greedy algorithm , partition (number theory) , monotone polygon , constraint (computer aided design) , pareto principle , weighted matroid , selection (genetic algorithm) , simple (philosophy) , combinatorics , matroid partitioning , computer science , artificial intelligence , graphic matroid , philosophy , geometry , epistemology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom