skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Award ID contains: 1747818

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, Discrete Applied Mathematics)
    null (Ed.)
    Full Text Available 
  2. ; ; ; (, Theoretical Computer Science)
    null (Ed.)
    Full Text Available 
  3. ; ; ; ; (, IEEE Transactions on Network Science and Engineering)
    Full Text Available 
  4. ; ; (, IEEE Transactions on Network Science and Engineering)
    Full Text Available 
  5. ; ; (, IEEE Transactions on Network Science and Engineering)
    Full Text Available 
  6. ; ; (, IEEE Transactions on Computational Social Systems)
    Full Text Available 
  7. ; ; ; ; (, IEEE Transactions on Network Science and Engineering)
    Full Text Available 
  8. ; (, IEEE Transactions on Computational Social Systems)
    Full Text Available 
  9. (, AAIM 2019)
    We consider a two-stage submodular maximization under p-matroid (or p-extendible) constraints. In the model, we are given a collection of submodular functions and some p-matroid (or extendible) system constraints for each of these functions, one need to choose a representative set with a cardinality constraint and simultaneously select a series of subsets that are restricted to the representative set for all functions, the aim is to maximize the average of the summarization of these function values. We extend the two-stage submodular maximization under single matroid to handle p-matroid (or p-extendible) constraints, and derive constant approximation ratio algorithms for the two problems, respectively. In the end, we empirically demonstrate the efficiency of our method on some datasets. 
    more » « less
    Full Text Available 
  10. ; ; ; ; (, ACM Transactions on Knowledge Discovery from Data)
    Full Text Available