Vinayaka Pandit

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the approximability of digraph ordering Algorithmica	2017-10-10	Paper
On the approximability of digraph ordering Lecture Notes in Computer Science	2015-11-19	Paper
Local search heuristic for k-median and facility location problems Proceedings of the thirty-third annual ACM symposium on Theory of computing	2015-02-27	Paper
Improved approximation for universal facility location	2014-10-13	Paper
Decision trees for entity identification, approximation algorithms and hardness results ACM Transactions on Algorithms	2014-09-09	Paper
Finding independent sets in unions of perfect graphs	2012-08-29	Paper
Scheduling Resources for Throughput Maximization Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2011-08-17	Paper
Bandwidth maximization in multicasting Lecture Notes in Computer Science	2010-03-03	Paper
Online and offline algorithms for the sorting buffers problem on the line metric Journal of Discrete Algorithms	2010-02-26	Paper
Approximating Decision Trees with Multiway Branches Automata, Languages and Programming	2009-07-14	Paper
Order Scheduling Models: Hardness and Algorithms FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science	2008-04-24	Paper
Offline Sorting Buffers on Line Algorithms and Computation	2008-04-24	Paper
Online Sorting Buffers on Line STACS 2006	2008-03-19	Paper
Local Search Heuristics for k-Median and Facility Location Problems SIAM Journal on Computing	2005-02-21	Paper

Research outcomes over time

This page was built for person: Vinayaka Pandit