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. 1001.1470
  4. Cited By
A New Approximation Technique for Resource-Allocation Problems
v1v2 (latest)

A New Approximation Technique for Resource-Allocation Problems

International Conference on Supercomputing (ICS), 2010
10 January 2010
B. Saha
A. Srinivasan
ArXiv (abs)PDFHTML

Papers citing "A New Approximation Technique for Resource-Allocation Problems"

2 / 2 papers shown
Near-feasible Fair Allocations in Two-sided Markets
Near-feasible Fair Allocations in Two-sided MarketsACM Conference on Economics and Computation (EC), 2025
Javier Cembrano
Andrés Moraga
Victor Verdugo
275
2
0
01 Jun 2025
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with
  Bounded Tree-width
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-widthEuropean Conference on Parallel Processing (Euro-Par), 2022
Eric Angel
Sébastien Morais
Damien Regnault
41
1
0
17 Feb 2022
1
Page 1 of 1