1554 search results - page 87 / 311 » Parameterized Complexity and Approximation Algorithms |
136
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
107
click to vote
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
OPODIS
2004
15 years 4 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
115
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
143
click to vote
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...