Result 1 to 20 of 271 total
On the max coloring problem. (English)
Theor. Comput. Sci. 462, 23-38 (2012).
1
Optimal number of bypasses: minimizing cost of calls to wireless phones under calling party pays. (English)
Ann. Oper. Res. 199, 179-191 (2012).
2
The (weighted) metric dimension of graphs: hard and easy cases. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selcted papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 114-125 (2012).
3
Online scheduling of jobs with fixed start times on related machines. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 134-145 (2012).
4
Universal sequencing on an unreliable machine. (English)
SIAM J. Comput. 41, No. 3, 565-586 (2012).
5
Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. (English)
Lecture Notes in Computer Science 7501. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). xx, 839~p. EUR~101.65 (2012).
6
On the absolute approximation ratio for first fit and related results. (English)
Discrete Appl. Math. 160, No. 13-14, 1914-1923 (2012).
7
The price of anarchy on uniformly related machines revisited. (English)
Inf. Comput. 212, 37-54 (2012).
8
Bin packing with general cost structures. (English)
Math. Program. 132, No. 1-2(A), 355-391 (2012).
9
On equilibria for ADM minimization games. (English)
Algorithmica 63, No. 1-2, 246-273 (2012).
10
Approximation schemes for packing splittable items with cardinality constraints. (English)
Algorithmica 62, No. 1-2, 102-129 (2012).
11
Online variable-sized bin packing with conflicts. (English)
Discrete Optim. 8, No. 2, 333-343 (2011).
12
Selfish bin coloring. (English)
J. Comb. Optim. 22, No. 4, 531-548 (2011).
13
Improved approximation guarantees for weighted matching in the semi-streaming model. (English)
SIAM J. Discrete Math. 25, No. 3, 1251-1265 (2011).
14
Max-min online allocations with a reordering buffer. (English)
SIAM J. Discrete Math. 25, No. 3, 1230-1250 (2011).
15
Online scheduling with rejection and withdrawal. (English)
Theor. Comput. Sci. 412, No. 48, 6666-6674 (2011).
16
Preemptive online scheduling with reordering. (English)
SIAM J. Discrete Math. 25, No. 1, 21-49 (2011).
17
Robust algorithms for preemptive scheduling. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 567-578 (2011).
18
On variants of file caching. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 195-206 (2011).
19
Selfish bin packing. (English)
Algorithmica 60, No. 2, 368-394 (2011).
20
Result 1 to 20 of 271 total
Start
Contact
Print
General Help
