Ramesh Krishnamurti

Available identifiers

zbMath Open krishnamurti.rameshMaRDI QIDQ203718

List of research outcomes

Publication	Date of Publication	Type
A primal-dual approximation algorithm for \textsc{minsat}	2022-08-04	Paper
On the minimum satisfiability problem	2020-07-21	Paper
Consistent subset problem with two labels	2018-06-05	Paper
Mulling over shapes, rules and numbers	2017-06-30	Paper
Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System	2017-04-07	Paper
PTAS for Ordered Instances of Resource Allocation Problems	2017-02-21	Paper
The cyclical scheduling problem	2014-10-06	Paper
The Cyclical Scheduling Problem	2013-04-12	Paper
An approximation algorithm for maxk-uncut with capacity constraints	2012-03-15	Paper
Conflict Resolution in the Scheduling of Television Commercials	2011-11-24	Paper
Erratum to: The capacitated max \(k\)-cut problem	2011-02-14	Paper
GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST	2010-05-28	Paper
A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times	2009-03-23	Paper
Self-duality of bounded monotone Boolean functions and related problems	2008-09-10	Paper
The capacitated max \(k\)-cut problem	2008-06-30	Paper
Advances in Artificial Intelligence	2007-07-19	Paper
Berge's theorem for the maximum charge problem	2006-10-10	Paper
Subset-conjunctive rules for breast cancer diagnosis	2006-04-28	Paper
The multiple TSP with time windows: vehicle bounds based on precedence graphs	2006-01-18	Paper
https://portal.mardi4nfdi.de/entity/Q4473243	2004-08-04	Paper
Average performance of greedy heuristics for the integer knapsack problem.	2004-02-02	Paper
On polynomial-time approximation algorithms for the variable length scheduling problem.	2003-08-17	Paper
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem	2002-09-30	Paper
An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems	2002-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q2753937	2001-11-11	Paper
Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability	2001-09-19	Paper
https://portal.mardi4nfdi.de/entity/Q4511216	2001-02-13	Paper
https://portal.mardi4nfdi.de/entity/Q4893400	1996-11-20	Paper
An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems	1996-09-15	Paper
https://portal.mardi4nfdi.de/entity/Q4287435	1995-03-01	Paper
The Minimum Satisfiability Problem	1995-02-13	Paper
Joint performance of greedy heuristics for the integer knapsack problem	1995-02-01	Paper
An efficient heuristic scheme for dynamic remapping of parallel computations	1994-10-31	Paper
A total-value greedy heuristic for the integer knapsack problem	1993-01-16	Paper
Optimal product design using conjoint analysis: Computational complexity and algorithms	1989-01-01	Paper
Average Performance of Heuristics for Satisfiability	1989-01-01	Paper

Research outcomes over time

This page was built for person: Ramesh Krishnamurti