1332 search results - page 2 / 267 » Combinatorial Algorithms |
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
WEA
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
SIGECOM
2000
ACM
13 years 9 months ago
2000
ACM
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...