Result 1 to 20 of 37 total
Extended formulations for polygons. (English)
Discrete Comput. Geom. 48, No. 3, 658-668 (2012).
1
From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk. (English)
Math. Oper. Res. 36, No. 2, 185-204 (2011).
2
Cover-decomposition and polychromatic numbers. (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, 799-810 (2011).
3
Some 0/1 polytopes need exponential size extended formulations. (English)
Comput. Res. Repos. 2011, Article No. 1105.0036 (2011).
4
The entropy rounding method in approximation algorithms. (English)
Comput. Res. Repos. 2011, Article No. 1104.4597 (2011).
5
Approximation algorithms for single and multi-commodity connected facility location. (English)
Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 248-260 (2011).
6
Set covering with ordered replacement: Additive and multiplicative gaps. (English)
Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 170-182 (2011).
7
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks. (English)
Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9‒10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 166-177 (2011).
8
From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk (English)
Math. Oper. Res. 36, No. 2, 185-204 (2011).
9
Cover-decomposition and polychromatic numbers (English)
ESA, 799-810 (2011).
10
Pricing on paths: A PTAS for the highway problem (English)
SODA, 675-684 (2011).
11
Bin packing via discrepancy of permutations (English)
SODA, 476-481 (2011).
12
Approximation algorithms for single and multi-commodity connected facility location (English)
IPCO, 248-260 (2011).
13
Set covering with ordered replacement: additive and multiplicative gaps (English)
IPCO, 170-182 (2011).
14
Optimal selection of customers for a last-minute offer. (English)
Oper. Res. 58, No. 4, Part 1, 878-888 (2010).
15
Connected facility location via random facility sampling and core detouring. (English)
J. Comput. Syst. Sci. 76, No. 8, 709-726 (2010).
16
Network design via core detouring for problems without a core. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 490-502 (2010).
17
Prizing on paths: A PTAS for the highway problem. (English)
Comput. Res. Repos. 2010, Article No. 1004.3051 (2010).
18
Optimal selection of customers for a last-minute offer (English)
Operations Research 58, No. 4-Part-1, 878-888 (2010).
19
Diameter of polyhedra: limits of abstraction (English)
Math. Oper. Res. 35, No. 4, 786-794 (2010).
20
Result 1 to 20 of 37 total
Start
Contact
Print
General Help
