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
... MLOP with a supermodular cost function, the greedy algorithm yields a factor 4 approximation to the optimal linear ordering. The proof is based on a scaling technique that is similar to dual fitting. We use a histogram to represent any ...
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings
... Principles of Distributed Computing, pp. 260–269 (2009) Buscarino, A., Fortuna, L., Frasca1, M., Latora, V.: Disease Spreading in Populations of Moving Agents. EPL (Europhysics Letters) 82(3) (2008) Chaintreau, A., Hui, P., Scott, J ...
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
... keywords. Outline of paper: In Section 2, we introduce a formal model for the knapsack secretary problem. We then give a pair of e-competitive algorithms for the unweighted knapsack secretary problem in Section 3. Finally, in Section 4 ...
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001
... solutions of near-optimal quality. We also showed experimentally that our ... Sipser. Graph bisection algorithms with good average case behavior. In ... solutions for graph bisection problems, International Joint Conference on Artificial ...
Automata, Languages and Programming: 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings
... hardware resource will not occur simultaneously. We say that resource, Hf, is subject to a sharing conflict if multiple accesses may occur concurrently. Sharing conflicts are dealt with by ... Hardware Source-Level Program Transformation.
Randomization Methods in Algorithm Design: DIMACS Workshop, December 12-14, 1997
... algorithm has a fast worst - case time behavior . However , clever algorithms can rapidly solve many SAT formulas of practical interest . There has been great interest in designing efficient algorithms ... solutions are known in restricted ...
Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques: Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,Berkeley, CA, USA, August 8-11, 1999 Pro
... 2,1 , ... , C2r , 1 do not form a K2r then c2r , 1 rerouted C2r , 1 C3 C3 ... UC , * CiCi + 1 for i = 2 , ... 2r 1 C2r Ø else continue applying the greedy ... Ct = 0 ) . If k = t / 2 and the chords of C1 , * , C2,1 , .. Ct , 1 form a Kt ...
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings
