Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Optimal partition of QoS requirements with discrete cost functions
Danny Raz,
Yuval Shavitt
School of Electrical Engineering
Lucent
Technion-Israel Institute of Technology
Research output
:
Contribution to journal
›
Article
›
peer-review
23
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Optimal partition of QoS requirements with discrete cost functions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Cost Function
100%
Optimal Partition
100%
Quality of Service Guarantee
100%
NP-complete
33%
Convex Cost Function
33%
Approximate Solution
33%
Exact Solutions
33%
World Wide Web
33%
Quality of Service
33%
Polynomial Approximation
33%
Approximation Scheme
33%
Differentiated Services
33%
Future Internet
33%
OrdA
33%
Computer Science
Quality of Service
100%
Service Requirement
100%
Optimal Partition
100%
Polynomial Approximation
25%
approximation scheme
25%
Support Application
25%
Mathematics
Cost Function
100%
Complex Problem
25%
Fully Polynomial Approximation Scheme
25%