Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory

doi 10.1109/infcom.2010.5462046
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Iterated Greedy Local Search Methods for Unrelated Parallel Machine Scheduling

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2010English

Performance Limits of Greedy Maximal Matching in Multi-Hop Wireless Networks

2007English

Scalability and Performance Improvement of Distributed Sequential Command Governor Strategies via Graph Colorability Theory

IFAC Proceedings Volumes
2014English

Around of Modeling Complex Network via Graph Theory

International Journal of Future Generation Communication and Networking
Computer NetworksCommunications
2014English

Greedy Maximization Framework for Graph-Based Influence Functions

2016English

A Greedy Double Swap Heuristic for Nurse Scheduling

Management Science Letters
AccountingManagementBusiness
2012English

Uncovering Relations Between Traffic Classifiers and Anomaly Detectors via Graph Theory

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Local Pooling Factor of Multihop Wireless Networks

2011English

Rearrangements and the Local Integrablility of Maximal Functions

Pacific Journal of Mathematics
Mathematics
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy