Rutgers Camden, Computer Science

Fingerprint Dive into the research topics where Rutgers Camden, Computer Science is active. These topic labels come from the works of this organization's members. Together they form a unique fingerprint.

Approximation algorithms Engineering & Materials Science
Approximation Algorithms Mathematics
Costs Engineering & Materials Science
Network coding Engineering & Materials Science
Approximation Mathematics
Vertex of a graph Mathematics
Graph in graph theory Mathematics
Polynomials Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects 2008 2019

Costs
Planning
Approximation algorithms
Fault tolerance
Computer science
Metabolism
Carbon
Biofuels
Fluxes
Metabolites
Students
Animation
Computer science
Pipelines
Computational geometry

Research Output 1984 2019

Approximating activation edge-cover and facility location problems

Nutov, Z., Kortsarz, G. & Shalom, E., Aug 1 2019, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019. Katoen, J-P., Heggernes, P. & Rossmanith, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 138).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chemical activation
Costs

Energy consumption of group search on a line

Czyzowicz, J., Georgiou, K., Killick, R., Kranakis, E., Krizanc, D., Lafond, M., Narayanan, L., Opatrny, J. & Shende, S., Jul 1 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 137. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Energy utilization
Robots
Data storage equipment
Energy dissipation
Physics

Improved approximation algorithms for minimum power covering problems

Calinescu, G., Kortsarz, G. & Nutov, Z., Jan 1 2019, (Accepted/In press) In : Theoretical Computer Science. 795, p. 285-300 16 p.

Research output: Contribution to journalArticle

Covering Problem
Approximation algorithms
Approximation Algorithms
Costs
Computational complexity