Lorant Porkolab

According to our database, Lorant Porkolab authored at least 16 papers between 1997 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes.

Klaus Jansen, Lorant Porkolab

SIAM J. Discret. Math., 2006

2005

General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.

Klaus Jansen, Lorant Porkolab

SIAM J. Comput., 2005

2004

Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring.

Klaus Jansen, Lorant Porkolab

J. Sched., 2004

2003

Computing optimal preemptive schedules for parallel tasks: linear programming approaches.

Klaus Jansen, Lorant Porkolab

Math. Program., 2003

2002

Polynomial time approximation schemes for general multiprocessor job shop scheduling.

Klaus Jansen, Lorant Porkolab

J. Algorithms, 2002

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.

Klaus Jansen, Lorant Porkolab

Algorithmica, 2002

On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.

Klaus Jansen, Lorant Porkolab

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

Approximate Max-Min Resource Sharing for Structured Concave Optimization.

Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio

SIAM J. Optim., 2001

Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.

Klaus Jansen, Lorant Porkolab

Math. Oper. Res., 2001

On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates.

Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.

Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Integer Optimization on Convex Semialgebraic Sets.

Leonid Khachiyan, Lorant Porkolab

Discret. Comput. Geom., 2000

Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time.

Klaus Jansen, Lorant Porkolab

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling.

Klaus Jansen, Lorant Porkolab

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1997

On the Complexity of Semidefinite Programs.

Lorant Porkolab, Leonid Khachiyan

J. Glob. Optim., 1997

Computing Integral Points in Convex Semi-algebraic Sets.

Leonid Khachiyan, Lorant Porkolab

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997