Back to Results
First PageMeta Content
Graph coloring / NP-complete problems / Edge coloring / Independent set / Matching / Maximal independent set / Interval graph / Bipartite graph / Domatic number / Graph theory / Mathematics / Theoretical computer science


On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§
Add to Reading List

Document Date: 2013-04-15 10:45:37

Open Document

File Size: 157,70 KB

Share Result on Facebook

City

La Jolla / Reykjavik / Haifa / /

Company

IBM / Intel / /

Country

Japan / United States / Iceland / Israel / /

Facility

University of Iceland / Science Institute / Japan Advanced Institute of Science / Tel-Aviv University / University of California / /

IndustryTerm

efficient solution / approximation algorithm / polynomial time algorithm / maximal waiting chain / approximate algorithm / randomized distributed algorithm / /

Organization

Israel Software Lab / Department of Computer Science / Science Institute / Japan Advanced Institute of Science and Technology / Hadas Shachnai Department / Department of Electrical Engineering / Department of Computer Science and Engineering / Tel-Aviv University / Tel-Aviv / University of Iceland / Technion / University of California at San Diego / /

Person

Hadas Shachnai / Tami Tamir / /

/

Position

Proposed Running Head / author was / /

Product

Cowon D2+ Portable Audio Device / Applications Our / /

ProgrammingLanguage

E / /

ProvinceOrState

California / /

Technology

following algorithm / polynomial time algorithm / approximation algorithm / randomized distributed algorithm / corresponding processors / The algorithm / 3.1 The MaxIS algorithm / MaxIS algorithm / /

SocialTag