Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

10 Publications


2019 | Conference Paper | LibreCat-ID: 10586
Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150
LibreCat | Files available | DOI
 

2019 | Dissertation | LibreCat-ID: 10003
Sprock, C. (2019). Zeiteffiziente messtechnische Analyse glatt-nichtlinearen Schwingverhaltens dynamischer Strukturen. Shaker.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 17651
Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, & A. Zelikovsky (Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham: Springer International Publishing.
LibreCat
 

2017 | Conference Paper | LibreCat-ID: 17652
Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2017). Filtering Undesirable Flows in Networks. In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-71150-8_1
LibreCat | DOI
 

2016 | Conference Paper | LibreCat-ID: 2367
Blömer, J., Brauer, S., & Bujna, K. (2016). A Theoretical Analysis of the Fuzzy K-Means Problem. In 2016 IEEE 16th International Conference on Data Mining (ICDM) (pp. 805–810). Barcelona, Spain: IEEE. https://doi.org/10.1109/icdm.2016.0094
LibreCat | DOI
 

2015 | Journal Article | LibreCat-ID: 17657
Cohen, R., & Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data Flows. Cloud Computing, IEEE Transactions On, PP(99), 1–1. https://doi.org/10.1109/TCC.2015.2487964
LibreCat | DOI
 

2014 | Journal Article | LibreCat-ID: 8171 | OA
Gharibian, S., & Kempe, J. (2014). Hardness of approximation for quantum problems. Quantum Information & Computation, 14(5–6), 517–540.
LibreCat | Download (ext.) | arXiv
 

2013 | Journal Article | LibreCat-ID: 17663
Cohen, R., Nudelman, I., & Polevoy, G. (2013). On the Admission of Dependent Flows in Powerful Sensor Networks. Networking, IEEE/ACM Transactions On, 21(5), 1461–1471. https://doi.org/10.1109/TNET.2012.2227792
LibreCat | DOI
 

2013 | Conference Paper | LibreCat-ID: 46388
Nallaperuma, S., Wagner, M., Neumann, F., Bischl, B., Mersmann, O., & Trautmann, H. (2013). A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem. Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII, 147–160. https://doi.org/10.1145/2460239.2460253
LibreCat | DOI
 

2010 | Journal Article | LibreCat-ID: 2990
Ackermann, M. R., Blömer, J., & Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. ACM Trans. Algorithms, (4), 59:1--59:26. https://doi.org/10.1145/1824777.1824779
LibreCat | DOI
 

Filters and Search Terms

keyword="approximation"

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed