Found: 7
Select item for more details and to access through your institution.
Set Cover Problems with Small Neighborhood Covers.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 8, p. 1763, doi. 10.1007/s00224-017-9842-1
- By:
- Publication type:
- Article
Improved algorithms for resource allocation under varying capacity.
- Published in:
- Journal of Scheduling, 2018, v. 21, n. 3, p. 313, doi. 10.1007/s10951-017-0515-3
- By:
- Publication type:
- Article
The Update Complexity of Selection and Related Problems.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 112, doi. 10.1007/s00224-015-9664-y
- By:
- Publication type:
- Article
Facility Location with Matroid or Knapsack Constraints.
- Published in:
- Mathematics of Operations Research, 2015, v. 40, n. 2, p. 446, doi. 10.1287/moor.2014.0678
- By:
- Publication type:
- Article
A divide and conquer strategy for scaling weather simulations with multiple regions of interest.
- Published in:
- Scientific Programming, 2013, v. 21, n. 4, p. 93, doi. 10.1155/2013/682356
- By:
- Publication type:
- Article
A divide and conquer strategy for scaling weather simulations with multiple regions of interest.
- Published in:
- Scientific Programming, 2013, v. 21, n. 3, p. 93, doi. 10.1155/2013/682356
- By:
- Publication type:
- Article
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem.
- Published in:
- Theory of Computing Systems, 2012, v. 51, n. 4, p. 447, doi. 10.1007/s00224-012-9405-4
- By:
- Publication type:
- Article