Amitabh Sinha

According to our database1, Amitabh Sinha authored at least 36 papers between 1990 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Data-Driven Promotion Planning for Paid Mobile Applications.
Inf. Syst. Res., 2020

2018
Joint Dynamic Pricing and Order Fulfillment for E-commerce Retailers.
Manuf. Serv. Oper. Manag., 2018

Dynamic Risk Management of Commodity Operations: Model and Analysis.
Manuf. Serv. Oper. Manag., 2018

2017
Capacity Investment with Demand Learning.
Oper. Res., 2017

2015
An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment.
Oper. Res., 2015

2012
The Learning Continuum: formal and informal learning experiences - enabling learning and creation of new knowledge in an organization.
Int. J. Adv. Corp. Learn., 2012

2011
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems.
SIAM J. Comput., 2011

Integrated Optimization of Procurement, Processing, and Trade of Commodities.
Oper. Res., 2011

2010
Approximation Algorithms for Multicommodity Facility Location Problems.
SIAM J. Discret. Math., 2010

Efficient Structures for Innovative Social Networks.
Manag. Sci., 2010

2009
Solving Truckload Procurement Auctions Over an Exponential Number of Bundles.
Transp. Sci., 2009

2008
On the approximability of some network design problems.
ACM Trans. Algorithms, 2008

Approximating k.
Eur. J. Oper. Res., 2008

2007
LP Rounding Approximation Algorithms for Stochastic Network Design.
Math. Oper. Res., 2007

2006
Min-Max payoffs in a two-player location game.
Oper. Res. Lett., 2006

Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.
Math. Program., 2006

Approximation Algorithms for Problems Combining Facility Location and Network Design.
Oper. Res., 2006

2005
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
Algorithmica, 2005

What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.
Proceedings of the Approximation, 2005

2004
An approximation algorithm for the edge-dilation <i>k</i>-center problem<sup>, </sup>.
Oper. Res. Lett., 2004

Min-max tree covers of graphs.
Oper. Res. Lett., 2004

Improved Approximations for Tour and Tree Covers.
Algorithmica, 2004

Non-Clairvoyant Scheduling for Minimizing Mean Slowdown.
Algorithmica, 2004

Boosted sampling: approximation algorithms for stochastic optimization.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Multicommodity facility location.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Worst-case payoffs of a location game.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
Profit guaranteeing mechanisms for multicast networks.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Covering Graphs Using Trees and Stars.
Proceedings of the Approximation, 2003

2002
Approximation Algorithms for Edge-Dilation k-Center Problems.
Proceedings of the Algorithm Theory, 2002

1996
Towards Automatic Performance Analysis.
Proceedings of the 1996 International Conference on Parallel Processing, 1996

1994
Information Sharing Mechanisms in Parallel Programs.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993
A Load Balancing Strategy for Prioritized Execution of Tasks.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992
Prioritization in Parallel Symbolic Computing.
Proceedings of the Parallel Symbolic Computing: Languages, 1992

1991
Supporting Machine Independent Programming on Diverse Parallel Architectures.
Proceedings of the International Conference on Parallel Processing, 1991

1990
Flush Message Passing in Communicating Sequential Processes.
Proceedings of the Parallel Architectures (Postconference PARBASE-90)., 1990


  Loading...