ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0807.0644
  4. Cited By
Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints
  and Submodular Cost
v1v2v3v4 (latest)

Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

International Colloquium on Automata, Languages and Programming (ICALP), 2008
4 July 2008
Christos Koufogiannakis
N. Young
ArXiv (abs)PDFHTML

Papers citing "Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost"

2 / 2 papers shown
Distributed algorithms for covering, packing and maximum weighted
  matching
Distributed algorithms for covering, packing and maximum weighted matchingDistributed computing (Distrib. Comput.), 2011
Christos Koufogiannakis
N. Young
52
34
0
27 May 2020
Graph Cuts with Interacting Edge Costs - Examples, Approximations, and
  Algorithms
Graph Cuts with Interacting Edge Costs - Examples, Approximations, and AlgorithmsMathematical programming (Math. Program.), 2014
Stefanie Jegelka
J. Bilmes
564
11
0
02 Feb 2014
1
Page 1 of 1