Back to Results
First PageMeta Content
Complexity classes / Mathematical optimization / Structural complexity theory / Conjectures / Permutation / NP / Directed acyclic graph / Optimization problem / Approximation algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics


On Rank Aggregation of Multiple Orderings in Network Design  Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel Lisa Zhang, Bell Labs, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974
Add to Reading List

Document Date: 2007-03-07 16:59:32


Open Document

File Size: 84,09 KB

Share Result on Facebook

City

San Francisco / Haifa / Perm / /

Company

Morgan Kaufmann Publishers Inc. / Lucent Technologies / /

Currency

USD / /

/

Event

Company Listing Change / /

Facility

Chuo University / /

IndustryTerm

deterministic algorithms / Deterministic approximation algorithms / polynomial time algorithm / search engines / optimization systems / network management / brute-force algorithm / Optical networks / approximation algorithms / heuristic solutions / /

Organization

Chuo University / Tokyo / Department of Computer Science / Cornell / Technion / Princeton Univ. / /

Person

Murray Hill / /

Position

Colonel / /

ProvinceOrState

New Jersey / /

Technology

brute-force algorithm / polynomial time algorithm / SONET / Deterministic approximation algorithms / Greedy algorithm / approximation algorithms / /

URL

http /

SocialTag