9842 search results - page 193 / 1969 » The Complexity of the Matching-Cut Problem |
116
click to vote
INFORMATICALT
2007
15 years 3 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
170
click to vote
HEURISTICS
2010
15 years 20 days ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
141
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
141
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
102
click to vote
CCCG
2010
15 years 4 months ago
2010
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...