# Pseudo-polynomial time

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- FSTTCS
- 2016

We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization… (More)

Is this relevant?

2015

2015

- ICALP
- 2015

We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from multi-dimensional mean-payoff to energy… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 28th IEEE International Real-Time Systems…
- 2007

In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the… (More)

Is this relevant?

2003

2003

- ISPD
- 2003

In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Real-Time Systems
- 1996

Scheduling analysis in real-time systems require an off-line feasibility (schedulability) test to guarantee the response time of… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Math. Program.
- 1996

Developing a polynomial time algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- ICALP
- 1995

We study a general class of bicriteria network design proble ms. A generic problem in this class is as follows: Given an… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- RTSS
- 1990

In this paper, we consider the preemptive scheduling of hard-real-time sporadic task systems on one processor. We rst give… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Real-Time Systems
- 1990

We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all… (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- IEEE Transactions on Computers
- 1984

This paper describes practical optimization/ approximation algorithms for scheduling a set of partially ordered computational… (More)

Is this relevant?