2477 search results - page 365 / 496 » Approximate extended formulations |
133
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
150
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
127
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
140
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
133
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
In several agent-oriented scenarios in the real world, an autonomous agent that is situated in an unknown environment must learn through a process of trial and error to take actio...