Sciweavers

1857 search results - page 55 / 372
» Minimum Degree Orderings
Sort
View
JSAC
2011
123views more  JSAC 2011»
13 years 1 months ago
The Asymptotic Behavior of Minimum Buffer Size Requirements in Large P2P Streaming Networks
—The growth of real-time content streaming over the Internet has resulted in the use of peer-to-peer (P2P) approaches for scalable content delivery. In such P2P streaming systems...
Srinivas Shakkottai, R. Srikant, Lei Ying
ORDER
2010
110views more  ORDER 2010»
13 years 9 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
JCO
2008
84views more  JCO 2008»
13 years 10 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
14 years 2 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 10 months ago
Optimal Order of Decoding for Max-Min Fairness in K-User Memoryless Interference Channels
A K-user memoryless interference channel is considered where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated t...
Mohammad Ali Maddah-Ali, Hajar Mahdavi-Doost, Amir...