E-LIB Suche - Ergebnisse für: Gaur, Daya Ram

1

A primal–dual approximation algorithm for Minsat:

Arif, Umair ; Benkoczi, Robert ; Gaur, Daya Ram.
Discrete Applied Mathematics. 319 (2022) - p. 372-381 , 2022

Link: https://doi.org/10.1016/..

2

Improved approximation algorithms for cumulative VRP with s..:

Gaur, Daya Ram ; Mudgal, Apurva ; Singh, Rishi Ranjan
Discrete Applied Mathematics. 280 (2020) - p. 133-143 , 2020

Link: https://doi.org/10.1016/..

3

On the Minimum Satisfiability Problem:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Arif, Umair ; Benkoczi, Robert ; Gaur, Daya Ram. - p. 269-281 , 2020

Link: https://doi.org/10.1007/..

4

Preface: CALDAM 2017:

Gaur, Daya Ram ; Narayanaswamy, N.S.
Discrete Applied Mathematics. 286 (2020) - p. 1-2 , 2020

Link: https://doi.org/10.1016/..

5

A heuristic for cumulative vehicle routing using column gen..:

Gaur, Daya Ram ; Singh, Rishi Ranjan
Discrete Applied Mathematics. 228 (2017) - p. 140-157 , 2017

Link: https://doi.org/10.1016/..

6

On a class of covering problems with variable capacities in..:

Akl, Selim ; Benkoczi, Robert ; Gaur, Daya Ram...
Theoretical Computer Science. 575 (2015) - p. 42-55 , 2015

Link: https://doi.org/10.1016/..

7

Routing vehicles to minimize fuel consumption:

Gaur, Daya Ram ; Mudgal, Apurva ; Singh, Rishi Ranjan
Operations Research Letters. 41 (2013) 6 - p. 576-580 , 2013

Link: https://doi.org/10.1016/..

8

Erratum to: The capacitated max k-cut problem:

Gaur, Daya Ram ; Krishnamurti, Ramesh ; Kohli, Rajeev
Mathematical Programming. 126 (2010) 1 - p. 191-191 , 2010

Link: https://doi.org/10.1007/..

9

On the fractional chromatic number of monotone self-dual Bo..:

Gaur, Daya Ram ; Makino, Kazuhisa
Discrete Mathematics. 309 (2009) 4 - p. 867-877 , 2009

Link: https://doi.org/10.1016/..

10

Conflict Resolution in the Scheduling of Television Commerc..:

Gaur, Daya Ram ; Krishnamurti, Ramesh ; Kohli, Rajeev
Operations Research. 57 (2009) 5 - p. 1098-1105 , 2009

Link: https://www.jstor.org/st..

11

The capacitated max k-cut problem:

Gaur, Daya Ram ; Krishnamurti, Ramesh ; Kohli, Rajeev
Mathematical Programming. 115 (2007) 1 - p. 65-72 , 2007

Link: https://doi.org/10.1007/..

12

On polynomial-time approximation algorithms for the variabl..:

Czumaj, Artur ; Ga̧sieniec, Leszek ; Gaur, Daya Ram...
Theoretical Computer Science. 302 (2003) 1-3 - p. 489-495 , 2003

Link: https://doi.org/10.1016/..

13

A-approximation algorithm for scheduling vehicles on a path..:

Gaur, Daya Ram ; Gupta, Arvind ; Krishnamurti, Ramesh
Information Processing Letters. 86 (2003) 2 - p. 87-91 , 2003

Link: https://doi.org/10.1016/..

14

Constant Ratio Approximation Algorithms for the Rectangle S..:

Gaur, Daya Ram ; Ibaraki, Toshihide ; Krishnamurti, Ramesh
Journal of Algorithms. 43 (2002) 1 - p. 138-152 , 2002

Link: https://doi.org/10.1006/..

15

An approximation algorithm for nonpreemptive scheduling on ..:

Krishnamurti, Ramesh ; Gaur, Daya Ram
Information Processing Letters. 72 (1999) 5-6 - p. 183-188 , 1999

Link: https://doi.org/10.1016/..