The following pages link to Rajiv Gandhi (Q494428):
Displayed 35 items.
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- Simultaneous approximation by Szász-Mirakjan-Stancu-Durrmeyer type operators (Q524183) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Algorithms for minimizing response time in broadcast scheduling (Q1879255) (← links)
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine (Q1949673) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- Global approximation theorems for the generalized Szàsz-mirakjan type operators in exponential weight spaces (Q2335603) (← links)
- Distributed algorithms for connected domination in wireless networks (Q2373893) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Simultaneous approximation by Szász-Mirakjan-Durrmeyer-type operators (Q2634131) (← links)
- Improved results for data migration and open shop scheduling (Q2944509) (← links)
- On Set Expansion Problems and the Small Set Expansion Conjecture (Q2945189) (← links)
- A summation-integral type modification of Szász-Mirakjan operators (Q2953373) (← links)
- Local and global results for modified Szász-Mirakjan operators (Q2988694) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- Dependent rounding and its applications to approximation algorithms (Q3546323) (← links)
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time (Q3595373) (← links)
- (Q4449173) (← links)
- (Q4535021) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- Bicovering: Covering edges with two small subsets of vertices (Q4598138) (← links)
- (Q4642212) (← links)
- (Q4737543) (← links)
- Approximation algorithms for partial covering problems (Q4826763) (← links)
- Improved bounds for scheduling conflicting jobs with minsum criteria (Q4962703) (← links)
- Direct Result for a Summation-Integral Type Modification of Szasz--Mirakjan Operators (Q4983916) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465876) (← links)
- Automata, Languages and Programming (Q5466502) (← links)
- Approximation algorithms for channel allocation problems in broadcast networks (Q5487810) (← links)
- Approximation and Online Algorithms (Q5713450) (← links)
- Sub-coloring and Hypo-coloring Interval Graphs (Q5851099) (← links)
- Corrigendum (Q5891963) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900921) (← links)
- Study of sensitivity of parameters of Bernstein-Stancu operators (Q6289354) (← links)