17329 search results - page 12 / 3466 » Improved non-approximability results |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
IFIP12
2007
13 years 10 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
?? ?? ???
?? ? ? ? ??
???
??? ? ?? ? ? ? ? ? ? ? ?
? ? ? ?? ? ? ? ? ? ? ??? ? ?? ?? ? ???? ? ? ?? ? ? ? ? ?
? ?? ? ?? ?? ??? ? ? ?? ?? ???
?? ? ? ? ??? ?
? ??? ????
???? ...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM