Paper

You must be logged in to use all features
Import a .START file
Add this to a Review
Tell someone about this
Search on Google Scholar
Download Bibtex
Download APA reference
Edit this data
Manage associations
Merge it with duplicates
Exec internal actor
Update from DOI
Add multiple references

A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation

2009

Created by ACM worker at 2019-04-10 11:45:16.0.

Simplified Graph of Associations

SHOW IT!!! (may be slow...)
How to use it
Use default pruning algorithm
Use alternative pruning algorithm
Generate image with complete graph
Show Graph Info
Download graph data for viewer
Get URL to embbed it anywhere

Word Cloud

Get URL to embbed it anywhere
Search topics on Google Scholar

Research Paradigm

Add/Edit Research Paradigms

Authors

View detailed list
Add an Author
Get URL to embbed this list anywhere

Venue

View detailed list
Add a Venue
Get URL to embbed this list anywhere

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC ’09

Referenced By

View detailed list
Add a Citer
Get URL to embbed this list anywhere

Coordination mechanisms from (almost) all scheduling policies

Help

Your opinion

Is it representative of "A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation"?

It does not represent at all.

Poorly representative, misses some key aspects.

Representative, but misses secondary aspects.

Representative, capaturing important aspects.

Very representative.

Does it provide additional information for your research?

Totally disagree.

Partially disagree.

Neutral.

Partially agree.

Totally agree.

How does this feature contributes to your overall usage of this system?

I use the system despite of this feature

Sometimes it is annoying

Neutral

Sometimes it is useful

I use the system because of this feature

Please provide any other comment or suggestion:

Your email (optional):

Let other people know about this data

Paper :

A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation

Send a link to this page to:

Send to yourself
Aditional email(s):
Custom message:

Add to a Bibliographic Set

A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation

Reviews owned by user

Why help?

If you for we can improve the data describing it. In turn, this can help you and other users to improve bibliographical sets and reviews, based on new data we retrieve after your contribution.

Graph Info

Information

Run Internal Actor

Scientific Paradigms

Select one or more research facets assignable to this publication:

Positivism

Post-Positivism

Critical-Ideological

Constructivism-Interpretativism

Other:

Add association

First, try and find an existing:
Name